Bases 6-32 reservations/statuses/primes

[kar_bon]

17459*6^25627-1 is prime!

[kar_bon]

35965*6^27098-1 is prime.

about 23100 candidates fewer to test!

the last sieve-file contains 258000 candidates for the remaining 17 k's (k=1597 and 9577 extra sieve). so after this 2nd prime there are about 223500 left!

[gd_barnes]

Originally Posted by kar_bon

here the first prime:

17459*6^25627-1 is prime!

it was the 10th candidate for this k i tested!!!
now about 11400 candidates less to test upto n=1M.

Great! Karsten, are you searching all of the other 17 k's at once? (I know you're doing the lowest 2 k's separately.) If so, when you report any prime, I'll just update all of the ranges searched to the n-value of the prime.


Thanks,
Gary

[kar_bon]

yeah, that's right. all remaining 17 k in one sieve file and llr testing.
i have to sieve much more but this was a blind shot and it works.

[michaf]

another one bites the dust:

110784*31^19748-1 is prime

That leaves 17 or bust :>

[michaf]

I decided to flood this thread:

51540*31^21120-1 is prime

Now there are 16 candidates left for Riesel base 31

[geoff]

I will start Sierpinski base 6 and test up to n=30K, if no-one else is working on it?

[gd_barnes]

Originally Posted by geoff

I will start Sierpinski base 6 and test up to n=30K, if no-one else is working on it?

I was just thinking of that one myself but my resources are quite busy so fire away! The bases divisible by 3 generally drop the k's pretty fast so it shouldn't be too bad even with a high conjecture.

Recommendation: Run PFGW 4 times, 1 each for k == 0 mod 5, 1 mod 5, 2 mod 5, and 3 mod 5 up to n=5K-7K before eliminating multiples of 6 and sieving/LLRing. It'll make for much cleaner pfgw.out files that get pretty huge with a large conjecture such as this one has.


Gary

[gd_barnes]

I am going to be a glutton for punishment and start Sierp base 19 from scratch and take all k's up to n=10K. The conjecture is k=765174.


Wish me luck!


Gary

[mdettweiler]

I've gained access, at least for the short term, to a Pentium 3 1Ghz machine, and though it would probably be mediocre at best for LLR, it should do fine for sieving. I've decided to reserve Riesel Base 30 k=25 for sieving up to n=100K. (I'll be releasing it after the sieving is over.) I've started the sieve with srsieve on my main crunching machine (P4 3.2Ghz), and when it's complete to roughly 0.5-1G (it should take only a few minutes) I'll move it to the Pentium3 and sieve it with sr1sieve.

Since k=25 is a power of 5, no n divisible by 5 can be prime; thus, I'll remove such n after sieving using the method Gary suggested to me in a PM earlier.

[gd_barnes]

Originally Posted by Anonymous

I've gained access, at least for the short term, to a Pentium 3 1Ghz machine, and though it would probably be mediocre at best for LLR, it should do fine for sieving. I've decided to reserve Riesel Base 30 k=25 for sieving up to n=100K. (I'll be releasing it after the sieving is over.) I've started the sieve with srsieve on my main crunching machine (P4 3.2Ghz), and when it's complete to roughly 0.5-1G (it should take only a few minutes) I'll move it to the Pentium3 and sieve it with sr1sieve.

Since k=25 is a power of 5, no n divisible by 5 can be prime; thus, I'll remove such n after sieving using the method Gary suggested to me in a PM earlier.

Yes it is a power of 5, but the analysis is incorrect. k=25 is a perfect square. You should remove all n divisible by 2 because 5^2=25. If it was a perfect 5th power, i.e. k=3^5=243, then you would remove all n divisible by 5.

Analysis: let k=m^2 and n=2q...so m^2*30^(2q)-1 = (m*30^q-1) * (m*30^q+1) hence all even n are composite.


Gary