Navigation
Topics  Register • News • History • How to • Sequences statistics • Template prototypes 
Riesel number
This article is only a stub. You can help PrimeWiki by expanding it. 
A Riesel number is a value of k such that k•2^{n}1 is always composite for all natural numbers.
Using the same method presented in the Sierpiński problem article, Hans Riesel found in 1956 that 509203•2^{n}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.
See also
 Riesel and Proth Prime Database
 Riesel problem
 Riesel prime
 15,000 Riesel numbers in the sequence A101036 in OEIS
 Category: Riesel numbers
External links
Number classes
General numbers 
Special numbers 
Prime numbers 
