View Single Post
Old 2018-12-30, 06:32   #10
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

386210 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
Yes. For example, the next prime after the Mersenne prime tested above is 2^61 + 15. PARI/GP proves its primality in 500 nanoseconds.

Moving to somewhat larger numbers, PARI/GP takes 150 ms to prove that 10^100 + 267 is prime. How long do you project that would take your program, assuming you networked all the computers in the world for the task?
Or the 2-year 16-core proof of 2^116224-15905? Note the 1 core test Fermat+Lucas test that took 37.00 seconds.

Last fiddled with by paulunderwood on 2018-12-30 at 06:33
paulunderwood is offline   Reply With Quote