Since I doubt no one else saw it since hardly anyone runs primegrid I thought I better post it. I made the front page of primegrid.com. Heres is a description of what I found. It's the 8th largest Fermat divisor. I'm still not exactly sure what it is I found, but it seems to be good. 🙂
On 27 Dec 2008 23:01:43 UTC, PrimeGrid's first Fermat divisor in the Proth Prime Search project was discovered:
651*2^476632+1 Divides F(476624).
It is only the 6th found Fermat divisor of 2008 and 270th overall. The prime is 143,484 digits long and is the 8th largest Fermat divisor in Chris Caldwell's ?The Largest Known Primes Database?.
The discovery was made by Eric Ueda of the United States using an Intel C2Q Q6600 @ 2.40 GHz with 1 GB RAM. This computer took almost 4 minutes 43 seconds to test. Eric is a member of TeAm AnandTech.
The prime was verified on 27 Dec 2008 23:56:34 UTC, by Beta-guy of Canada using an Intel C2Q Q9450 @ 2.66 GHz with 2 GB RAM. This computer took almost 4 minutes 20 seconds to test. Beta-guy is a member of team Canada.
The credits for the discovery are as follows:
1. Eric Ueda (United States), discoverer
2. PrimeGrid, et al.
3. Srsieve, sieving program developed by Geoff Reynolds
4. 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=86060.
And yes I created this post to try to drum up some support for the Boinc project primegrid. Once you sign up go to "your account" to "primegrid preferences" and just select proth prime search if you want some smaller ~5 minute tests. Some of the other wu can last around 1 full day. Prime numbers for this project will make the top 5000 list and come in at around 2000 on the list. I am running around 1 prime for every 3000 tests.
On 27 Dec 2008 23:01:43 UTC, PrimeGrid's first Fermat divisor in the Proth Prime Search project was discovered:
651*2^476632+1 Divides F(476624).
It is only the 6th found Fermat divisor of 2008 and 270th overall. The prime is 143,484 digits long and is the 8th largest Fermat divisor in Chris Caldwell's ?The Largest Known Primes Database?.
The discovery was made by Eric Ueda of the United States using an Intel C2Q Q6600 @ 2.40 GHz with 1 GB RAM. This computer took almost 4 minutes 43 seconds to test. Eric is a member of TeAm AnandTech.
The prime was verified on 27 Dec 2008 23:56:34 UTC, by Beta-guy of Canada using an Intel C2Q Q9450 @ 2.66 GHz with 2 GB RAM. This computer took almost 4 minutes 20 seconds to test. Beta-guy is a member of team Canada.
The credits for the discovery are as follows:
1. Eric Ueda (United States), discoverer
2. PrimeGrid, et al.
3. Srsieve, sieving program developed by Geoff Reynolds
4. 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=86060.
And yes I created this post to try to drum up some support for the Boinc project primegrid. Once you sign up go to "your account" to "primegrid preferences" and just select proth prime search if you want some smaller ~5 minute tests. Some of the other wu can last around 1 full day. Prime numbers for this project will make the top 5000 list and come in at around 2000 on the list. I am running around 1 prime for every 3000 tests.
