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"
(more links) |
m |
||
Line 2: | Line 2: | ||
A '''Riesel number''' is a value of ''k'' such that {{Kbn|k|n}} is always composite for all [[natural number]]s. | 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, [[Hans Riesel]] found in 1956 that [[Riesel prime 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]]'''), a [[distributed computing project]] was created named [[Riesel Sieve]]. | ||
Line 11: | Line 11: | ||
*[[Riesel prime]] | *[[Riesel prime]] | ||
*15,000 Riesel numbers in the {{OEIS|l|A101036}} | *15,000 Riesel numbers in the {{OEIS|l|A101036}} | ||
− | *[[ | + | *[[Riesel 2 Riesel|Riesel numbers]] |
==External links== | ==External links== |
Revision as of 19:03, 16 August 2021
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
- Riesel and Proth Prime Database
- Riesel problem
- Riesel prime
- 15,000 Riesel numbers in the sequence A101036 in OEIS
- Riesel numbers
External links
Number classes
General numbers |
Special numbers |
|
Prime numbers |
|