Riesel number

Riesel number

In mathematics, a Riesel number is an odd natural number "k" for which the integers of the form "k"·2"n"−1 are composite for all natural numbers "n".

In other words, when "k" is a Riesel number, all members of the following set are composite:

:left{,k 2^n - 1 : n inmathbb{N}, ight}

In 1956, Hans Riesel showed that there are an infinite number of integers "k" such that "k"·2"n"−1 is not prime for any integer "n". He showed that the number 509203 has this property, as does 509203 plus any positive integer multiple of 11184810.

A number can be shown to be a Riesel number by giving its "covering set". A covering set is a set of small prime numbers that will divide any member of a sequence, so called because it is said to "cover" that sequence. The only proven Riesel numbers below one million have the following covering sets:

* 509203×2"n"−1 has covering set {3, 5, 7, 13, 17, 241}
* 762701×2"n"−1 has covering set {3, 5, 7, 13, 17, 241}
* 777149×2"n"−1 has covering set {3, 5, 7, 13, 19, 37, 73}
* 790841×2"n"−1 has covering set {3, 5, 7, 13, 19, 37, 73}
* 992077×2"n"−1 has covering set {3, 5, 7, 13, 17, 241}

The Riesel problem consists in determining the smallest Riesel number. Because no covering set has been found for any "k" less than 509203, it is conjectured that 509203 is the smallest Riesel number. However, sixty-five values of "k" less than this have yielded only composite numbers for all values of "n" so far tested. The smallest of these are 2293, 9221, 23669, 31859, 38473, 40597, 46663, 65531, 67117 and 74699. Thirty numbers have had primes found by the Riesel Sieve project (analogous to Seventeen or Bust for Sierpinski numbers).

ee also

* Sierpinski number

References

*

External links

* [http://www.rieselsieve.com Riesel Sieve Project]
* [http://www.prothsearch.net/rieselsearch.html Riesel search]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Riesel Sieve — is a distributed computing project, running in part on the BOINC platform. Its aim is to prove that 509203 is the smallest Riesel number, by finding a prime of the form k · 2 n −1 for all odd k smaller than 509203.Progress of the projectAt the… …   Wikipedia

  • Riesel — can refer to:People* Hans Riesel, mathematician * Victor Riesel, journalistIn Mathematics* Riesel number, an odd natural number k for which the integers of the form k ·2 n −1 are all compositePlaces* Riesel, Texas …   Wikipedia

  • Hans Riesel — Hans Ivar Riesel (born 1929 in Stockholm) is a Swedish mathematician who discovered the 18th known Mersenne prime in 1957. He also discovered the Riesel numbers. He is currently at the Royal Institute of Technology.elected publications*External… …   Wikipedia

  • 100000 (number) — List of numbers – Integers 10000 100000 1000000 Cardinal One hundred thousand Ordinal One hundred thousandth Factorization 25 · 55 Roman numeral C Roman numeral (Unicode) …   Wikipedia

  • Sierpinski number — In number theory, a Sierpinski number is an odd natural number k such that integers of the form k 2 n + 1 are composite (i.e. not prime) for all natural numbers n .In other words, when k is a Sierpinski number, all members of the following set… …   Wikipedia

  • Lucas-Lehmer-Riesel test — The Lucas Lehmer Riesel test is a primality test for numbers of the form N=k 2^n 1, with 2^n > k. The test was developed by Hans Riesel and it is based on the Lucas–Lehmer test for Mersenne numbers.The algorithmThe algorithm is very similar to… …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • Computational number theory — In mathematics, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations. The best known problem in the field is integer factorization. See also Computational… …   Wikipedia

  • Perfect number — In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also known as its aliquot sum). Equivalently, a perfect… …   Wikipedia

  • General number field sieve — In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of log2 n bits) is of …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”