Riesel Sieve

Riesel Sieve

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 project

At the start of the project in August 2003, there were 101 "k" less than 509203 for which no prime "k" · 2"n"−1 was known. As of|2008|8, more than thirty of these "k" had been eliminated; the largest prime found by this project is 485,767 · 23,609,357−1 of 1,086,531 digits, [ [http://primes.utm.edu/bios/page.php?id=581 Riesel Sieve Project] at The Prime Pages. Retrieved 2008-08-04.] and it is known that for none of the remaining "k" is there a prime with "n" < 2 million.

The project proceeds in the same way as other prime-hunting projects like GIMPS or Seventeen or Bust: sieving eliminates pairs ("k", "n") with small factors, and then a deterministic test, in this case the Lucas-Lehmer-Riesel test based on the Lucas-Lehmer test, is used to check primality of numbers without small factors. Users can choose whether to sieve or to run LLR tests on candidates sieved by other users; heavily-optimised sieving software is available.

Riesel Sieve maintains lists of the primes that have been found [Riesel Sieve, [http://stats.rieselsieve.com/primes.php Project Prime Finder Hall of Fame] .] and the "k" whose status is still unknown. [Riesel Sieve, [http://stats.rieselsieve.com/kstats.php Current k Status] .]

As of 18 September 2008, the Riesel Sieve project had not been active since late June 2008. [BOINC Message Boards : [http://boinc.berkeley.edu/dev/forum_thread.php?id=2853 Projects : Riesel Sieve?] ]

References

External links

* [http://www.rieselsieve.com The official Riesel Sieve home page] .
* [http://www.prothsearch.net/rieselprob.html Definition and status of the problem]
* [http://allprojectstats.com/po.php?projekt=14 Riesel Sieve project statistics]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • 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… …   Wikipedia

  • Sieve of Eratosthenes — Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime s square). In mathematics, the sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους), one of a number of prime number sieves, is a simple,… …   Wikipedia

  • Nombre De Riesel — Un nombre de Riesel est, en mathématiques un entier naturel impair k pour lequel les entiers de la forme k×2n 1 sont tous composés. Sommaire 1 Définition 2 Propriétés 3 Problème de Riesel …   Wikipédia en Français

  • Nombre de riesel — Un nombre de Riesel est, en mathématiques un entier naturel impair k pour lequel les entiers de la forme k×2n 1 sont tous composés. Sommaire 1 Définition 2 Propriétés 3 Problème de Riesel …   Wikipédia en Français

  • Nombre de Riesel — Un nombre de Riesel est, en mathématiques un entier naturel impair k pour lequel les entiers de la forme k×2n 1 sont tous composés. Sommaire 1 Définition 2 Propriétés 3 Problème de Riesel …   Wikipédia en Français

  • 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

  • Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… …   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

  • PrimeGrid — Développeur Rytis Slatkevičius Première version 12 …   Wikipédia en Français

  • Liste der Projekte verteilten Rechnens — Verschiedene Projekte gewinnen die zu ihrer Durchführung benötigte Rechenkapazität über verteiltes Rechnen, das heißt, durch die Verteilung der Rechenleistung auf Einzelgeräte und Rechnerpools, die von ihren Besitzern zu diesem Zweck zur… …   Deutsch Wikipedia

Share the article and excerpts

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