SRBase: Difference between revisions
clarify |
link |
||
| Line 6: | Line 6: | ||
== Why SRBase? == | == Why SRBase? == | ||
For every base (b) for the forms k*b^n+1 and k*b^n-1, there is a k-value for each form that has been conjectured to be the lowest 'Sierpinski value' (+1 form) or 'Riesel value' (-1 form) that is composite for all values of n >= 1. | |||
* | |||
== Goal == | == Goal == | ||
Prove Riesel and Sierpinski conjectures for bases <= 1030 that are not currently being worked on by other projects or efforts. | |||
== Methods == | == Methods == | ||
The project is in collaboration with the Mersenne CRUS project. The server is running on a private computer in a VM. | The project is in collaboration with the [https://www.mersenneforum.org/showthread.php?t=9738 '''''Mersenne CRUS project''''']. The server is running on a private computer in a VM. | ||
[https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE'''''] | [https://srbase.my-firewall.org/sr5/download/srbase-guide.pdf '''''BEHIND SRBASE - A SHORT GUIDE'''''] | ||