Tweaks.

Author: Oren (electricessence)

MathExtensions.cs

@@ -6,7 +6,6 @@
 using System;
 using System.Collections.Generic;
 using System.Linq;
-using Open.Formatting;
 
 namespace Open.Arithmetic
 {
@@ -161,7 +160,6 @@ public static double Quotient(this IEnumerable<double> source)
 			return result;
 		}
 
-
 		public static double QuotientOf(this IEnumerable<double> divisors, double numerator)
 		{
 			var any = false;
@@ -198,194 +196,6 @@ public static double Difference(this IEnumerable<double> source)
 		}
 
 
-
-		/// <summary>
-		/// Ensures addition tolerance by trimming off unexpected imprecision.
-		/// </summary>
-		public static double SumAccurate(this double source, double value)
-		{
-			var result = source + value;
-			var vp = source.DecimalPlaces();
-			if (vp > 15)
-				return result;
-			var ap = value.DecimalPlaces();
-			if (ap > 15)
-				return result;
-
-			var digits = Math.Max(vp, ap);
-
-			return Math.Round(result, digits);
-		}
-
-		/// <summary>
-		/// Ensures addition tolerance by trimming off unexpected imprecision.
-		/// </summary>
-		public static double ProductAccurate(this double source, double value)
-		{
-			var result = source * value;
-			var vp = source.DecimalPlaces();
-			if (vp > 15)
-				return result;
-			var ap = value.DecimalPlaces();
-			if (ap > 15)
-				return result;
-
-			var digits = Math.Max(vp, ap);
-
-			return Math.Round(result, digits);
-		}
-
-		/// Ensures addition tolerance by using integer math.
-		public static double SumUsingIntegers(this double source, double value)
-		{
-			var x = Math.Pow(10, Math.Max(source.DecimalPlaces(), value.DecimalPlaces()));
-
-			var v = (long)(source * x);
-			var a = (long)(value * x);
-			var result = v + a;
-			return (double)result / x;
-		}
-
-
-
-		public static bool IsPrime(this int n)
-		{
-			var a = System.Math.Abs(n);
-			if (a == 2 || a == 3)
-				return true;
-
-			if (a % 2 == 0 || a % 3 == 0)
-				return false;
-
-			var divisor = 6;
-			while (divisor * divisor - 2 * divisor + 1 <= a)
-			{
-
-				if (a % (divisor - 1) == 0)
-					return false;
-
-				if (a % (divisor + 1) == 0)
-					return false;
-
-				divisor += 6;
-
-			}
-
-			return true;
-
-		}
-
-		public static bool IsPrime(this double n)
-		{
-			return (System.Math.Floor(n) == n)
-				? IsPrime((int)n)
-				: false;
-		}
-
-        public static ulong NextPrime(this ulong n)
-        {
-            if (n == 0)
-                return 0;
-
-            while (!IsPrime(n))
-            {
-                if (n == ulong.MaxValue)
-                    throw new Exception(string.Format("The next prime is greater than the UInt64.MaxValue of {0}.", ulong.MaxValue));
-
-                n++;
-            }
-
-            return n;
-        }
-
-        public static int NextPrime(this int n)
-		{
-			if (n == 0)
-				return 0;
-
-            var sign = n < 0 ? -1 : 1;
-            n = Math.Abs(n);
-
-            while (!IsPrime(++n))
-            { }
-
-			return sign * n;
-		}
-
-		public static int NextPrime(this double a)
-		{
-			return NextPrime((int)a);
-		}
-
-		public static IEnumerable<int> Multiples(this int a)
-		{
-			yield return a < 1 ? -1 : 1;
-			if (a < 1) a = Math.Abs(a);
-
-			for (var i = 2; a != 1 && i <= a; i = i.NextPrime())
-			{
-				while (a % i == 0)
-				{
-					yield return i;
-					a /= i;
-				}
-			}
-		}
-
-
-		public static IEnumerable<double> Multiples(this double a)
-		{
-			if (double.IsNaN(a))
-			{
-				yield return a;
-			}
-			else
-			{
-				yield return a < 1 ? -1 : 1;
-				if (a < 1) a = Math.Abs(a);
-
-				if (double.IsInfinity(a) || Math.Floor(a) != a)
-				{
-					yield return a;
-				}
-				else
-				{
-					for (var i = 2; a != 1 && i <= a; i = i.NextPrime())
-					{
-						while (a % i == 0)
-						{
-							yield return i;
-							a /= i;
-						}
-					}
-				}
-			}
-		}
-
-		// returns all the primes that do not include 1 or the number itself.
-		public static IEnumerable<double> DivisibleMultiples(this double a)
-		{
-			var m = a.Multiples().Skip(1);
-
-			foreach (var i in m)
-			{
-				if (i == a) break;
-				yield return i;
-			}
-		}
-
-		// returns all the primes that do not include 1 or the number itself.
-		public static IEnumerable<int> DivisibleMultiples(this int a)
-		{
-			var m = a.Multiples().Skip(1);
-
-			foreach (var i in m)
-			{
-				if (i == a) break;
-				yield return i;
-			}
-		}
-
 	}
 }
 

Open.Arithmetic.csproj

@@ -17,4 +17,8 @@ Part of the "Open" set of libraries.</Description>
     <PackageTags>dotnet, dotnet-core, dotnetcore, cs, math, dynamic, arithmetic</PackageTags>
   </PropertyGroup>
 
+  <ItemGroup>
+    <PackageReference Include="Open.Collections" Version="1.1.0" />
+  </ItemGroup>
+
 </Project>