View Single Post
Old 2014-04-10, 08:20   #13
jnml
 
Feb 2012
Prague, Czech Republ

A416 Posts
Default

Quote:
Originally Posted by tapion64 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.
M-R test is deterministic in that range if you use proper bases: http://miller-rabin.appspot.com/
jnml is offline   Reply With Quote