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

Riesel number

From Prime-Wiki
Revision as of 14:08, 24 January 2019 by Karbon (talk | contribs) (restored)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Logo.svg 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.

See also

External links