//Generic NextPrime funcion given a primality test public static BigInteger NextPrime(this BigInteger number, IPrimeTest gen) { if (number < 2) { return(2); } var next = number + (number.IsEven ? 1 : 2); while (!gen.IsPrime(next)) { next += 2; } return(next); }
/// <exception cref="ArgumentNullException">primeTest is null</exception> public PrimeGenerator(IPrimeTest primeTest) { Checker.CheckNull(primeTest); this.primeTest = primeTest; }