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
(cat. changed)
(more links)
(One intermediate revision by the same user not shown)
Line 1: Line 1:
 
{{Stub}}
 
{{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]].
 
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 problem]]
 
*[[Riesel prime]]
 
*[[Riesel prime]]
 +
*15,000 Riesel numbers in the {{OEIS|l|A101036}}
 +
*[[:Category:Riesel k=Riesel|Category: Riesel numbers]]
  
 
==External links==
 
==External links==
 
*[http://mathworld.wolfram.com/RieselNumber.html MathWorld]
 
*[http://mathworld.wolfram.com/RieselNumber.html MathWorld]
 
*[[Wikipedia:Riesel number|Riesel number]]
 
*[[Wikipedia:Riesel number|Riesel number]]
 +
{{Navbox NumberClasses}}
 
[[Category:Number]]
 
[[Category:Number]]

Revision as of 10:46, 8 June 2020

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), a distributed computing project was created named Riesel Sieve.

See also

External links

Number classes
General numbers
Special numbers
Prime numbers