public void FindCorrectPrimeNumbersBetweenZeroAndTwo() { var primes = PrimeFactorization.FindPrimeNumbers(0, 2); Assert.AreEqual(1, primes.Count); Assert.AreEqual(2, primes[0]); }
static void Main() { var primes = PrimeFactorization.FindPrimeNumbers(1, 2000000); var result = CalculateSum(primes); Console.WriteLine("Sum of all the prime numbers below 2 000 000 is : " + result); Console.ReadKey(); }
public void FindCorrectPrimeNumbersBetweenZeroAndTwenty() { var primes = PrimeFactorization.FindPrimeNumbers(0, 20); Assert.AreEqual(8, primes.Count); Assert.AreEqual(2, primes[0]); Assert.AreEqual(3, primes[1]); Assert.AreEqual(5, primes[2]); Assert.AreEqual(7, primes[3]); Assert.AreEqual(11, primes[4]); Assert.AreEqual(13, primes[5]); Assert.AreEqual(17, primes[6]); }
public static IEnumerable <long> GeneratePrimeNumbers(int amountToGenerate) { var primeNumbers = new List <long>(); long minValue = 0; long patchSize = 100; var maxValue = patchSize; while (primeNumbers.Count <= amountToGenerate) { var foundPrimes = PrimeFactorization.FindPrimeNumbers(minValue, maxValue); primeNumbers.AddRange(foundPrimes); var lastIndex = primeNumbers.Count - 1; minValue = primeNumbers[lastIndex] + 1; maxValue = primeNumbers[lastIndex] + patchSize; } return(primeNumbers.Take(amountToGenerate)); }