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
(Internationalizing with {{Num}})
(links)
 
Line 4: Line 4:
 
Using the same method presented in the [[Sierpiński problem]] article, [[Hans Riesel]] found in 1956 that [[Riesel prime 2 509203|{{Kbn|509203|n}}]] is always composite.
 
Using the same method presented in the [[Sierpiński problem]] article, [[Hans Riesel]] found in 1956 that [[Riesel prime 2 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]].
+
In order to demonstrate whether 509203 is the smallest Riesel number or not (the '''[[Riesel problem 1]]'''), a [[distributed computing project]] was created named [[Riesel Sieve]].
  
 
==See also==
 
==See also==
 
*[[Riesel and Proth Prime Database]]
 
*[[Riesel and Proth Prime Database]]
*[[Riesel problem]]
+
*[[Riesel problem 1]]
 
*[[Riesel prime]]
 
*[[Riesel prime]]
 
*{{Num|15000}} Riesel numbers in the {{OEIS|l|A101036}}
 
*{{Num|15000}} Riesel numbers in the {{OEIS|l|A101036}}

Latest revision as of 08:21, 25 March 2024

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

Using the same method presented in the Sierpiński problem article, Hans 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 1), a distributed computing project was created named Riesel Sieve.

See also

External links

Number classes
General numbers
Special numbers
Prime numbers