Riesel Base 35
 

R35 completed to n=25k!

74 primes found for 20k<n<25k. 767 k-values remain.

I will next sieve to n=100k, could take some time.

3x Riesel base 36 primes
 

I found three primes on my base 36 reservation.

Primality testing 25679*36^98885-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 5, base 1+sqrt(5)
[B]25679*36^98885-1[/B] is prime! (8375.2145s+0.0123s)

Primality testing 60029*36^53684-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 5, base 1+sqrt(5)
[B]60029*36^53684-1[/B] is prime! (2277.7269s+0.0231s)

Primality testing 75703*36^64193-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 5, base 1+sqrt(5)
[B]75703*36^64193-1[/B] is prime! (3043.5447s+0.0093s)

Willem.

R46 & R48 update
 

Base 46

currently at n=47K no primes

Base 48

currently at n=38K 6 primes so far

2421*48^26418-1
1597*48^27871-1
2526*48^28950-1
1369*48^31567-1
743*48^33189-1
2622*48^34243-1

[QUOTE=Siemelink;213545]I found three primes on my base 36 reservation.

[B]25679*36^98885-1[/B] is prime! (8375.2145s+0.0123s)
[B]60029*36^53684-1[/B] is prime! (2277.7269s+0.0231s)
[B]75703*36^64193-1[/B] is prime! (3043.5447s+0.0093s)

Willem.[/QUOTE]

Make that four:
Primality testing 41669*36^68136-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 5, base 1+sqrt(5)
[B]41669*36^68136-1[/B] is prime! (3998.3110s+0.0085s)

Willem.

[quote=Siemelink;213763]Make that four:
Primality testing 41669*36^68136-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 5, base 1+sqrt(5)
[B]41669*36^68136-1[/B] is prime! (3998.3110s+0.0085s)

Willem.[/quote]

Can you give me a search limit on the remaining k's that you are testing?

[quote=kar_bon;213492]R35 completed to n=25k!

74 primes found for 20k<n<25k. 767 k-values remain.

I will next sieve to n=100k, could take some time.[/quote]


Nice work Karsten. This now completes all Riesel bases < 39 with CK<1G to n=25K. :smile:

I have you fully reserved to n=100K on this one. Will you only be sieving n=25K-100K or will you be testing that range also?

[QUOTE=gd_barnes;213808]Will you only be sieving n=25K-100K or will you be testing that range also?[/QUOTE]

Sure, I will try to test to that n=100k. I have to test, if I could sieve for a higher n-range, too.

[QUOTE=gd_barnes;213804]Can you give me a search limit on the remaining k's that you are testing?[/QUOTE]

That is a bit fuzzy. I started with the sieve file sorted by n and I have reached k = 58,000 on all my k's on base 36. But then I decided to sort by k and run witht he Number of primes option. That way I don't have to remove the k from the sieve file after I find a prime. It works like a charm: Find a prime and PFGW switches to the next k.
Of course now it is a bit fuzzy where I am with progress. And I run this on several PCs at the moment, none of which I can reach at the moment. I know I have finished a few of the reservered k. By the time it is all done, I'll package the residu's in one file, sort them on k and it will be logical again. By the way do you care to have the lower residu's for k's that have a prime?

Cheers, Willem.

[quote=Siemelink;213897]That is a bit fuzzy. I started with the sieve file sorted by n and I have reached k = 58,000 on all my k's on base 36. But then I decided to sort by k and run witht he Number of primes option. That way I don't have to remove the k from the sieve file after I find a prime. It works like a charm: Find a prime and PFGW switches to the next k.
Of course now it is a bit fuzzy where I am with progress. And I run this on several PCs at the moment, none of which I can reach at the moment. I know I have finished a few of the reservered k. By the time it is all done, I'll package the residu's in one file, sort them on k and it will be logical again. By the way do you care to have the lower residu's for k's that have a prime?

Cheers, Willem.[/quote]

That's fine to search by k and if it's a hassle to send results, don't worry about it for the primed k's. I definitely need results for the non-primed k's. I'll go ahead and show all k's searched to n=58K. Usually what people have done when searching by k is kind of what you are doing here. I just wasn't aware that you were searching that way. That is, they post a grouping of k's as complete and primes found, if any. I think Mathew did it 3-5 k's at a time for base 30. The main difference is that he also showed completed non-primed k's as he went so that I could release them.

The stop-on-prime option works fine if the file is sorted by n-value also so why would you need to remove k's when primes are found? I do [I]think [/I]I know what you mean. That is: If the machine must be stopped, then it's easier if sorted by k because you don't have to remove primed k's when restarting.

BTW and this came originally from KEP (I think), I like to sort by n but sometimes need to stop the machine. If so, I quickly put all of the primes at the top of the sieve file, delete pairs already processed, and start a new search. It will refind the primes and won't process any more pairs for those k's. That's quite a bit easier than manually removing a bunch of k's with srfile. That's my exclusively used method now because I only like to search by k at very small n-ranges. Anything above n=2500, I like to search by n to get rid of lots of k's more quickly. :-)


Gary

Reserving S72 for n=40K-100K.

R46
 

Riesel base 46 is complete to n=50K. No primes. I am releasing the base.

Attached are the results plus a sieve file to n=100K.