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"

From Prime-Wiki
Jump to: navigation, search
m
(cat. changed)
Line 14: Line 14:
 
*[http://mathworld.wolfram.com/RieselNumber.html MathWorld]
 
*[http://mathworld.wolfram.com/RieselNumber.html MathWorld]
 
*[[Wikipedia:Riesel number|Riesel number]]
 
*[[Wikipedia:Riesel number|Riesel number]]
[[Category:Math]]
+
[[Category:Numbers]]

Revision as of 08:24, 8 February 2019

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, 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.

See also

External links