Difference between revisions of "Riesel number"

Revision as of 10:46, 8 June 2020

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 for all natural numbers.

Using the same method presented in the Sierpiński problem article, Hans 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 1: / Line 1: @@
 {{Stub}}
-A '''Riesel number''' is a value of k such that k &times; 2<sup>n</sup> - 1 is always composite.
+A '''Riesel number''' is a value of ''k'' such that {{Kbn|k|n}} is always composite for all [[natural number]]s.
-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.
+Using the same method presented in the [[Sierpiński problem]] article, [[Hans Riesel]] found in 1956 that [[Riesel prime 509203|{{Kbn|509203|n}}]] 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]].
@@ Line 10: / Line 10: @@
 *[[Riesel problem]]
 *[[Riesel prime]]
+*15,000 Riesel numbers in the {{OEIS|l|A101036}}
+*[[:Category:Riesel k=Riesel|Category: Riesel numbers]]
 ==External links==