As reference, a modern computer can easily discover all the Mersenne primes up to 4423 nearly instantaneously, and up to 23209 (but almost 44497) in 12 hours of computation. Pari/GP ispseudoprime (i.e., not the specialized Lucas-Lehmer algorithm), 2G stack size.
No comments :
Post a Comment