Join PrimeGrid
Returning Participants
Community
Leader Boards
Results
Other
drummerslowrise

Message boards :
Number crunching :
Which conjecture most likely to find a prime?
Author 
Message 

If I understand correctly, there are five conjecture subprojects: ESP, PSP, TRP, SOB, and SR5. Which of these is the most likely (easiest?) to find a prime?
I am hunting K badges. =;^)
____________
Reno, NV
 

tngSend message
Joined: 29 Aug 10 Posts: 416 ID: 66603 Credit: 29,226,582,582 RAC: 40,704,304

If I understand correctly, there are five conjecture subprojects: ESP, PSP, TRP, SOB, and SR5. Which of these is the most likely (easiest?) to find a prime?
I am hunting K badges. =;^)
SR5 is searching for the smallest primes, and I'm pretty sure that's what matters.
Good luck bagging one!
____________
 


TRP has been an abnormally long time without a prime k.
____________
SHSIDElectronicsGroup@outlook.com
waiting for a TdP prime...
Proth "SoB": 44243*2^440969+1
 


If I understand correctly, there are five conjecture subprojects: ESP, PSP, TRP, SOB, and SR5. Which of these is the most likely (easiest?) to find a prime?
I am hunting K badges. =;^)
SR5 is searching for the smallest primes, and I'm pretty sure that's what matters.
Good luck bagging one!
Agree. From the front page today:
23 CPU Extended Sierpinski Problem (LLR)
13 CPU Prime Sierpinski Problem (LLR)
8 CPU Seventeen or Bust (LLR)
73 CPU Sierpinski / Riesel Base 5 Problem (LLR)
46 CPU The Riesel Problem (LLR)
So SR5 ranks lowest at 73rd position on the Top 100 list, so highest density of primes there. Are base 5 candidates less efficient to test than base 2, with LLR2?
/JeppeSN  


Yes, but with a linear coefficient.  


Thanks guys. I will run SR5.
I did not know that smallest = easiest to find. Out of curiosity, why is that? I understand that smallest probably means the tasks run fastest, so you can run more tasks in a given amount of time. But couldn't it also be true that there may just be less primes to find in a particular conjecture, and therefore less likely to find primes? I guess I don't understand the relationship between the size of the prime and the likelihood of finding one.
____________
Reno, NV
 

Michael GoetzVolunteer moderator Project administrator
Send message
Joined: 21 Jan 10 Posts: 13633 ID: 53948 Credit: 278,923,048 RAC: 149,039

Thanks guys. I will run SR5.
I did not know that smallest = easiest to find. Out of curiosity, why is that? I understand that smallest probably means the tasks run fastest, so you can run more tasks in a given amount of time. But couldn't it also be true that there may just be less primes to find in a particular conjecture, and therefore less likely to find primes? I guess I don't understand the relationship between the size of the prime and the likelihood of finding one.
Primes become rarer as the numbers get larger. And, as you noted, the tests get longer.
When you combine both factors, the "difficulty" of finding a prime is proportional to slightly more than the cube of the size of the number. Another way to look at is if you double the size of the number, it will take you about 10 times longer to find a prime.
There's other factors, of course. Some types of primes use faster testing methods, more sieving lowers the time needed to find a prime, etc. But other things being equal. just doubling the size of the number increases the difficulty (time) of finding a prime by roughly tenfold.
____________
My lucky number is 75898^{524288}+1  


Thanks for the explanation.
____________
Reno, NV
 

Post to thread
Message boards :
Number crunching :
Which conjecture most likely to find a prime? 