At current rate port will be empty in about 60 days.
So, after that, project will be over or there will be new test available?
____________
92*10^^1585996-1 NEAR-REPDIGIT PRIME :) :) :)
4 * 650^⁴⁹⁸¹⁰¹-1 CRUS PRIME
2022202116^¹³¹⁰⁷²+1 GENERALIZED FERMAT
Proud member of team Aggie The Pew. Go Aggie!

MEGA is testing some 10<k<100, N~=3.4M:
http://prpnet.mine.nu:12010/pending_tests.html
I can't see why we can't just keep testing higher N. Can't see the reservation on http://www.prothsearch.com/ though.
____________

I dont know can we or can we not search deeper, so I ask admins to answer :)
____________
92*10^^1585996-1 NEAR-REPDIGIT PRIME :) :) :)
4 * 650^⁴⁹⁸¹⁰¹-1 CRUS PRIME
2022202116^¹³¹⁰⁷²+1 GENERALIZED FERMAT
Proud member of team Aggie The Pew. Go Aggie!

Can someone explain to me: when I found SR5 number , that K was immediately suspended from further crunching.
But in this range MEGA has already founded one prime, but it ( look like) will crunching to end .
So why is MEGA so different then SR5?
Thanks for reply.
____________
92*10^^1585996-1 NEAR-REPDIGIT PRIME :) :) :)
4 * 650^⁴⁹⁸¹⁰¹-1 CRUS PRIME
2022202116^¹³¹⁰⁷²+1 GENERALIZED FERMAT
Proud member of team Aggie The Pew. Go Aggie!

The purpose of SR5 is to prove two conjectures.

The purpose of MEGA is to find prime numbers.

The two projects have very different goals. In SR5, we're attempting to prove the conjectures by find a prime at each of the remaining k's. If we find a prime for every k, the conjecture is proven. There's no need to find more than one prime at each k to prove the conjecture, so after a prime is found we stop searching that k since it's a waste of computer resources.

For MEGA, we're just looking for prime numbers, so there's no reason to stop searching a k because a prime was already found.
____________
My lucky number is 75898⁵²⁴²⁸⁸+1

The purpose of SR5 is to prove two conjectures.

The purpose of MEGA is to find prime numbers.

The two projects have very different goals. In SR5, we're attempting to prove the conjectures by find a prime at each of the remaining k's. If we find a prime for every k, the conjecture is proven. There's no need to find more than one prime at each k to prove the conjecture, so after a prime is found we stop searching that k since it's a waste of computer resources.

For MEGA, we're just looking for prime numbers, so there's no reason to stop searching a k because a prime was already found.

Pooh, thanks for explanation!
I ask that question since I "calculate chance of finding prime" in ESP or MEGA.
Since there is 14 left K at ESP and 3 K are eliminated ( primes are found) then I assume that chance is bigger in ESP then in MEGA.
Even if only few K have prime, and other doesnot have it, I still assume chance is bigger. And at the end of range for k on ESP , number is about 1.200.000 digits long so it will be big prime :)
____________
92*10^^1585996-1 NEAR-REPDIGIT PRIME :) :) :)
4 * 650^⁴⁹⁸¹⁰¹-1 CRUS PRIME
2022202116^¹³¹⁰⁷²+1 GENERALIZED FERMAT
Proud member of team Aggie The Pew. Go Aggie!