[quote=mdettweiler;161465]Another one for Sierp. base 33:

1818*33^79815+1 is prime!

Only one k remaining for Sierp. base 33 (at n=100K and unreserved as previously reported in the bases > 32 status thread)--and this prime [URL="http://primes.utm.edu/primes/page.php?id=86511"]makes the top-5000[/URL] to boot! :grin:[/quote]


Nice one!

This is amazing! We have yet ANOTHER Sierpinski base with 1 k remaining at n=100K. These final k's on the Sierp side are truly stubborn.


Gary

Riesel Base 35
 

here is my first base-35 prime.
after 2 'small' generalized woodalls the only one in the TOP5000 currently in the big list!

75570*35^74111-1 is prime!

i checked this k alone, because it was the one with the most candidates left to n=100k!

My first non-power-of-2 top-5000 prime:

2377*28^104621+1 is prime :smile:

4 k's to go on Sierp base 28

Riesel and Sierp base 28 are both now at n=105K.


Gary

Riesel base 19
 

Primality testing 28034*19^92302-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 5, base 5+sqrt(5)
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
28034*19^92302-1 is prime! (10748.9939s+0.0356s)

I grabbed a bunch of k's, sieved them for a while and then continued only with the one that had the most candidates. I've done 57% of the range when I had found the prime.

Happy me, Willem.

Excellent prime Willem! :smile:

[QUOTE=Siemelink;169753]Primality testing 28034*19^92302-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 5, base 5+sqrt(5)
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
28034*19^92302-1 is prime! (10748.9939s+0.0356s)

I grabbed a bunch of k's, sieved them for a while and then continued only with the one that had the most candidates. I've done 57% of the range when I had found the prime.

Happy me, Willem.[/QUOTE]

I'm curious to know if LLR is faster than phrot for this base. Did you compare both programs?

[QUOTE=rogue;169813]I'm curious to know if LLR is faster than phrot for this base. Did you compare both programs?[/QUOTE]

Nope, the last time I thought of Phrot was when you were busy tweaking it.

Cheers, Willem.

[QUOTE=Siemelink;169933]Nope, the last time I thought of Phrot was when you were busy tweaking it.

Cheers, Willem.[/QUOTE]

It's pretty solid now. I am only aware of an issue with GFNs (b^(2^m)+1), but since genefer is primarily used for GFNs, I'm not too concerned about fixing it.

If you do decide to putter around with it, I'd be curious to see some comparison timings.

Here's a nice one:

3104*22^161188-1 is prime :smile:

I FINALLY got another one on my large base 22/27/28 testing.

Only 1 k to go on Riesel base 22; continuing it up to n=200K. What else is new? ...many bases with 1 k remaining, especially on the Sierp side.


Gary

Primality testing 8681*30^140627-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 11, base 1+sqrt(11)
Calling Brillhart-Lehmer-Selfridge with factored part 47.32%
8681*30^140627-1 is prime! (15798.4912s+0.0541s)

Tralala, Willem.

[QUOTE=Siemelink;187403]8681*30^140627-1 is prime![/QUOTE]

There're only three base-30 primes in the Top5000 list, 9 years old and all Gen.Woodall's.
This is 10 times greater than those. Nice find!