WOW, what a HUGE prime! Congratulations!
:groupwave:

[QUOTE=rebirther;445097][URL="http://primes.utm.edu/primes/page.php?id=122375"]29*2^8727880-1[/URL] (2627356 digits) found by [AF>EDLS]GuL

This find is for base R1024 and maybe solved the base. There is some work left so I must wait until I know it for sure.[/QUOTE]

Great find! AFAICT, that does prove the conjecture for R1024 as 29*2^8727880-1 = 29*1024^872788-1. As one of the many people who worked on that one, it is nice to see one of the base 2 conjectures be proven. S128, S256, and S512 are likely to be the next to fall, but who knows when that will happen.

[QUOTE=rebirther;445097][URL="http://primes.utm.edu/primes/page.php?id=122375"]29*2^8727880-1[/URL] (2627356 digits) found by [AF>EDLS]GuL

This find is for base R1024 and maybe solved the base. There is some work left so I must wait until I know it for sure.[/QUOTE]

A big congrats! This is CRUS's second largest prime ever and largest prime for a power-of-2 base! :smile:

:banana::chris2be8::bow wave::beer:

[QUOTE=rebirther;445097][URL="http://primes.utm.edu/primes/page.php?id=122375"]29*2^8727880-1[/URL] (2627356 digits) found by [AF>EDLS]GuL

This find is for base R1024 and maybe solved the base. There is some work left so I must wait until I know it for sure.[/QUOTE]

:no: It has been deleted from the top5000 -- you should really verify a prime before submission to it. :not prime:

[QUOTE=paulunderwood;445118]:no: It has been deleted from the top5000 -- you should really verify a prime before submission to it. :not prime:[/QUOTE]
I dont understand that. What does it mean verify before submit?

Edit:
ok, I see the problem, the prime was not composite. I will double check all primes in the future.

Double check it. :smile:

You should run prime search on the boinc grid with minimum quorum set to two and not one.

[QUOTE=paulunderwood;445120]Double check it. :smile:[/QUOTE]

I thought the double check is doing the prime pages. I have never double check any primes before and had no problem. Whats different?

[QUOTE=rebirther;445122]I thought the double check is doing the prime pages. I have never double check any primes before and had no problem. Whats different?[/QUOTE]

1. It does not waste The Prime Pages resources.

2. It saves false congratulations.

:smile:

[QUOTE=rebirther;445122]I thought the double check is doing the prime pages. I have never double check any primes before and had no problem. Whats different?[/QUOTE]

What Paul is saying is that you should run yourself on different OS and CPU's the numbers before you submit to the top5000 database so you won't rely on computers you don't know if they are stable or nor and rely on stable ones.

[QUOTE=rebirther;445122]I thought the double check is doing the prime pages. I have never double check any primes before and had no problem. Whats different?[/QUOTE]

Prime Pages does run a double check of submissions. However, this is not the preferred way to weed out false positives (they don't want the Prime Pages servers testing junk, so they have some semi-strict rules about cutting you off if you submit too many composite numbers). Before submitting a prime, you should check it twice.

Most of the time this doesn't really matter, because a number generally only is reported as prime if it is prime. Sometimes, a computer glitch makes it report that it's prime when it's not. That's what happened this time. Running it a second time, especially on a different computer, significantly reduces the possibility of a false positive.