mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

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: 36,022
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: 36,022
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: 36,022
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 23:45.

Sat Nov 28 23:45:44 UTC 2020 up 79 days, 20:56, 3 users, load averages: 1.20, 1.15, 1.14

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.