PrimeGrid’s
The Riesel Problem
On 21 Nov 2010, 11:14:00 UTC, PrimeGrid’s The Riesel Problem project eliminated
k=191249 by finding the Mega prime:191249*2^3417696-1
The prime is 1,028,835 digits long and enters Chris Caldwell's “The Largest Known
Primes Database” (http://primes.utm.edu/primes) ranked 29th overall. This is the 2ndlargest prime found in The Riesel Problem and the first k elimination in over 2 1/2years. 63 k's now remain.
The discovery was made by Jonathan Pritchard of the United Kingdom using an AMD
Phenom 9950 with 8GB RAM, running Windows 7. This computer took 7 hours and31 minutes to complete the primality test using LLR. Jonathan is a member of theTuran@BOINC team.
The prime was verified on 23 Nov 2010, 07:28:00, by Jan Haller of Germany using
an Intel Pentium E5400 @ 2.70 GHz with 3 GB RAM, running 32 bit Windows XP
Professional. This computer took a little over 6 hours 45 minutes to complete theprimality test using LLR.
The credits for the discovery are as follows:
1. Jonathan Pritchard (United Kingdom), discoverer
2. PrimeGrid, et al.
3. Riesel Sieve
4. Srsieve, sieving program developed by Geoff Reynolds
5. LLR, primality program developed by Jean Penné
Entry in “The Largest Know Primes Database” can be found here:
http://primes.utm.edu/primes/page.php?id=96689
Hans Ivar Riesel, a Swedish mathematician, showed in 1956 that there are an
infinite number of positive odd integer k's such that k*2^n-1 is composite (notprime) for every integer n>=1. These numbers are now called Riesel numbers. He
further showed that k=509203 was such one.
It is conjectured that 509203 is the smallest Riesel number. The Riesel Problem
consists in determining that 509203 is the smallest Riesel number. To show that itis the smallest, a prime of the form k*2^n-1 must be found for each of the positive
integer k's less than 509203. For more information about The Riesel Problem,
please visit Wilfrid Keller's The Riesel Problem: Definition and Status(http://www.prothsearch.net/rieselprob.html).
Using a single PC would have taken years to find this prime. So this timely
discovery would not have been possible without the hundreds of volunteers who
contributed their spare CPU cycles. In honor of the previous effort, this first prime isshared with Riesel Sieve. A special thanks to everyone who offered their advice and/or computing power to the search - especially Sean Faith and Brian Carpenter who
provided support information from the previous Riesel Sieve effort.
The Riesel Problem project will continue to seek primes for the 63 remaining k's.
To join the search please visit PrimeGrid: http://www.primegrid.com

PrimeGrid’s
The Riesel Problem
About PrimeGrid
PrimeGrid is a distributed computing project, developed by Rytis Slatkevičius, whichutilizes BOINC and PRPNet to search for primes. PrimeGrid's primary goal is to bringthe excitement of prime finding to the "everyday" computer user. Simply download
the software and let your computer do the rest. Participants can choose from avariety of prime forms to search. With a little patience, you may find a large or evenrecord breaking prime.
BOINC
The Berkeley Open Infrastructure for Network Computing (BOINC) is asoftware platform for distributed computing using volunteered computerresources. It allows users to participate in multiple distributed computing
projects through a single program. Currently BOINC is being developed by ateam based at the University of California, Berkeley led by David Anderson.
This platform currently supports projects from biology to math to astronomy.
For more information, please visit BOINC: http://boinc.berkeley.edu
PRPNet
PRPNet is a client/server application written by Mark Rodenkirch that is
specifically designed to help find prime numbers of various forms. It is easily
ported between various OS/hardware combinations. PRPNet does not run
each PRP test itself, but relies on helper programs, such as LLR, PFGW, phrot,
and genefer to do the work.
For more information, please visit PrimeGrid’s PRPNet forum thread:
http://www.primegrid.com/forum_thread.php?id=1215
For more information about PrimeGrid and a complete list of available prime search
projects, please visit: http://www.primegrid.com