### Finding the first prime p ≥ m

This returns an integer p which is a strong base 2 pseudoprime and a Lucas probable prime.
See *The Pseudoprimes to 25.10*^{9},
Mathematics of computation, 35 (1980) 1003-1026, Mathematics of computation, 35 (1980) 1003-1026,

Carl Pomerance; J. L. Selfridge; Samuel S. Wagstaff.

At the end of this paper it is conjectured that
if n is a strong base 2 pseudoprime and a Lucas
probable prime, then n is in fact a prime.

*Last modified 3rd July 2011*

Return to main page