| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Riesel number"
(restored) |
m |
||
| Line 7: | Line 7: | ||
==See also== | ==See also== | ||
| − | *[[Riesel Prime Database]] | + | *[[Riesel and Proth Prime Database]] |
==External links== | ==External links== | ||
Revision as of 14:15, 24 January 2019
|
This article is only a stub. You can help PrimeWiki by expanding it. |
A Riesel number is a value of k such that k × 2N - 1 is always composite.
Using the same method presented in the Sierpinski problem article, Riesel found in 1956 that 509203 × 2N - 1 is always composite.
In order to demonstrate whether 509203 is the smallest Riesel number or not (the Riesel conjecture), a distributed computing project was created. Its name is Riesel Sieve.
