| 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"
(cat. changed) |
m |
||
| Line 2: | Line 2: | ||
A '''Riesel number''' is a value of k such that k × 2<sup>n</sup> - 1 is always composite. | A '''Riesel number''' is a value of k such that k × 2<sup>n</sup> - 1 is always composite. | ||
| − | Using the same method presented in the [[ | + | Using the same method presented in the [[Sierpiński problem]] article, H.Riesel found in 1956 that 509203 × 2<sup>n</sup> - 1 is always composite. |
| − | In order to demonstrate whether 509203 is the smallest Riesel number or not (the '''[[Riesel problem]]'''), a [[ | + | In order to demonstrate whether 509203 is the smallest Riesel number or not (the '''[[Riesel problem]]'''), a [[distributed computing project]] was created named [[Riesel Sieve]]. |
==See also== | ==See also== | ||
Revision as of 10:57, 20 February 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 Sierpiński problem article, H.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 problem), a distributed computing project was created named Riesel Sieve.
