View Single Post
Old 2014-04-10, 08:00   #12
Apr 2014

5×17 Posts

Originally Posted by retina View Post
I'd rather use a deterministic method since it should be just as fast on such a small number. Technically we could use msieve for the test to screen, and then check with GIMPS to see if any data for the exponent exists, since GIMPS knows all the primes less than 2^32.
tapion64 is offline   Reply With Quote