Difference between revisions of "Riesel number"

Revision as of 11:29, 7 March 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 × 2ⁿ - 1 is always composite.

Using the same method presented in the Sierpiński problem article, H.Riesel found in 1956 that 509203 × 2ⁿ - 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.

Number classes

General numbers

Special numbers

Prime numbers

@@ Line 2: / Line 2: @@
 A '''Riesel number''' is a value of k such that k &times; 2<sup>n</sup> - 1 is always composite.
-Using the same method presented in the [[Sierpinski problem]] article, H.Riesel found in 1956 that 509203 &times; 2<sup>n</sup> - 1 is always composite.
+Using the same method presented in the [[Sierpiński problem]] article, H.Riesel found in 1956 that 509203 &times; 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 [[:Category:distributed computing project|distributed computing project]] was created named [[Riesel Sieve]].
+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==
@@ Line 14: / Line 14: @@
 *[http://mathworld.wolfram.com/RieselNumber.html MathWorld]
 *[[Wikipedia:Riesel number|Riesel number]]
-[[Category:Math]]
+{{Navbox NumberClasses}}
+[[Category:Number]]