mersenneforum.org Search Results
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 3 of 3 Search took 0.01 seconds. Search: Posts Made By: pcco74
 Forum: Sierpinski/Riesel Base 5 2005-02-14, 02:15 Replies: 358 Views: 47,222 Posted By pcco74 Hey, 51460*5^50468+1 is prime. (35281 digits) ... Hey, 51460*5^50468+1 is prime. (35281 digits) Primality testing 51460*5^50468+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Calling Brillhart-Lehmer-Selfridge with factored...
 Forum: Sierpinski/Riesel Base 5 2005-02-02, 19:43 Replies: 358 Views: 47,222 Posted By pcco74 The reason k must be odd for base 2 is that if k... The reason k must be odd for base 2 is that if k is even, you can always divide it by 2 until you get an odd k, and increase n accordingly. Ex. 10*2^2+1=5*2^3+1. This simply eliminates testing the...
 Forum: Sierpinski/Riesel Base 5 2005-02-02, 14:01 Replies: 358 Views: 47,222 Posted By pcco74 Yves Gallot's site also lists n as having to be... Yves Gallot's site also lists n as having to be greater than or equal to one. http://www.prothsearch.net/sierp.html
 Showing results 1 to 3 of 3

All times are UTC. The time now is 06:24.

Mon May 16 06:24:26 UTC 2022 up 32 days, 4:25, 0 users, load averages: 0.98, 1.24, 1.27