Fastest sieving program?

[PawnProver44]

Originally Posted by Batalov

There are some exceptions... but they are rare:

-----  -------------------------------- ------- ----- ---- --------------
 rank           description              digits  who year comment
-----  -------------------------------- ------- ----- ---- --------------
  206  46821*2^3021380-374567            909531  p363 2013
  217  18976*2^2976221-18975             895937  p373 2014 
 1816  37674760044125*2^1513679-67931    455677  p339 2012 (**)
 2241  31723*2^1398273-507567            420927  p363 2013 (**)

If you somehow happen to factor k*b^n+-c to 33.33% (rare) you can find primes of the form k*b^n+-c to make the Prime Pages' top 5000.

[pepi37]

What is your mission PawnProver44?
To have few sieve samples, and do LLR and find prime that can go to Top 5000?
I read your topic , and answers from people on this forum.
Use Primegrid data , and start LLR-ing. It is fastest way to find some prime.
You can not compete with the knowledge of mathematics with people on this forum, because everyone knows mathematics far better than you (because of the way your issues)
Another thing is that some of them, if not most, have a much stronger computing power than you had 'em.
And last, it is essential, if not the most important, you need to have luck. I've seen individuals to PrimeGrid which are with very old computers after only a few candidates find prime number, which is entered in the Top 5000 list without problems. But they are rare. All the others have worked or are working for years to achieve something.
Therefore, go and do not ask indefinitely. This is definitely the only way with which you will not find any prime number.

[a1call]

If a mathematician tells you that 2+2=4, then you are wise to take it to the bank.
On the other hand if he tells you that there is no way you can prove that a large ordinary prime is prime, ask him to prove it.
If he can't, then it's up to you to take his word as gospel, I wouldn't.

[PawnProver44]

Originally Posted by a1call

If a mathematician tells you that 2+2=4, then you are wise to take it to the bank.
On the other hand if he tells you that there is no way you can prove that a large ordinary prime is prime, ask him to prove it.
If he can't, then it's up to you to take his word as gospel, I wouldn't.

There are several PRPs on http://www.primenumbers.net/prptop/prptop.php that are of the form k*b^n+c and are about 20,000 to 80,000 digits, if those can't be proven prime, then It would be harder to prove a number 5 times that size prime (of the form k*b^n-+c). It is still possible, but very hard.

[PawnProver44]

Originally Posted by pepi37

What is your mission PawnProver44?
To have few sieve samples, and do LLR and find prime that can go to Top 5000?
I read your topic , and answers from people on this forum.
Use Primegrid data , and start LLR-ing. It is fastest way to find some prime.
You can not compete with the knowledge of mathematics with people on this forum, because everyone knows mathematics far better than you (because of the way your issues)
Another thing is that some of them, if not most, have a much stronger computing power than you had 'em.
And last, it is essential, if not the most important, you need to have luck. I've seen individuals to PrimeGrid which are with very old computers after only a few candidates find prime number, which is entered in the Top 5000 list without problems. But they are rare. All the others have worked or are working for years to achieve something.
Therefore, go and do not ask indefinitely. This is definitely the only way with which you will not find any prime number.

If you looked on my last post, http://mersenneforum.org/showthread.php?t=21065 I wanted to find (probable) primes of the form k*b^n+c (large enough) I was hoping the sieving would be faster. I gave up on finding large (probable) primes of the form 60*79^n+19, sice it takes too long to test exponents, so now I just use random k*b^n+c forms.

[pepi37]

Originally Posted by PawnProver44

There are several PRPs on http://www.primenumbers.net/prptop/prptop.php that are of the form k*b^n+c and are about 20,000 to 80,000 digits, if those can't be proven prime, then It would be harder to prove a number 5 times that size prime (of the form k*b^n-+c). It is still possible, but very hard.

So your mission is to find lets say 450.000 digit long PRP and prove it is prime?
Very specific wish :)
Good luck on your hunt for PRP

[PawnProver44]

Originally Posted by pepi37

So your mission is to find lets say 450.000 digit long PRP and prove it is prime?
Very specific wish :)
Good luck on your hunt for PRP

Do you seriously mean that, or are you just joking around?

[PawnProver44]

My other post was useless.