[QUOTE=gd_barnes;247222]...and adding a 3ker to our list![/QUOTE]

Make that a 2ker. :smile:

3193*148^104224+1 is prime! (‎226197 digits)

[QUOTE]Make that a 2ker. :smile:

3193*148^104224+1 is prime! (‎226197 digits) [/QUOTE]

Somebody's on a roll. :bow: Congrats

[QUOTE=vmod;247548]Make that a 2ker. :smile:

3193*148^104224+1 is prime! (‎226197 digits)[/QUOTE]

A great prime pair vmod!

Just curious for reporting purposes on the pages: What is your current search depth on the other 2 k's and how high to you intend to search them? It's good that you surpassed your initial reservation of n=100K. :-)

S737
 

S737 tested n=25K-100K

[URL]http://primes.utm.edu/primes/page.php?id=97673[/URL]
38*737^93785+1 is prime

4*737^n+1 is now a 1ker with a weight = 1117

Results emailed - Base released

[QUOTE=gd_barnes;247718]You'll likely need 2-4 CPU months to test it to n=200K and the chance of prime by that point will be ~20%.

I just want you to be aware of the effort involved.

Good luck! :smile:[/QUOTE]

Well I guess I am a lucky prime hunter this time. What should my new proof code look like, i.e. which project(s) should I include? CRUS? SierpinskiRiesel?

Thanks
Peter

[QUOTE=Puzzle-Peter;249311]Well I guess I am a lucky prime hunter this time. What should my new proof code look like, i.e. which project(s) should I include? CRUS? SierpinskiRiesel?

Thanks
Peter[/QUOTE]

Puzzle-Peter;

Congrats on proving [URL="http://primes.utm.edu/primes/page.php?id=97761"]R170[/URL]

and lucky you [URL="http://primes.utm.edu/primes/page.php?id=97685"]R5/R25 prime[/URL]

Indeed a very good week for you.

[QUOTE=Puzzle-Peter;249311]Well I guess I am a lucky prime hunter this time. What should my new proof code look like, i.e. which project(s) should I include? CRUS? SierpinskiRiesel?

Thanks
Peter[/QUOTE]

A big congrats, Peter, on proving one of our remaining k=2 bases! :smile:

FYI for everyone's quick reference:
2*170^166428-1 is prime!

The smallest base with k=2 remaining is now Sierp base 218, which has 2 k's remaining at n=100K.

Ingo Buechel, Wilfred Keller, and David Broadhurst found:

2*467^126775+1 is prime

See [URL]http://primes.utm.edu/primes/page.php?id=97818[/URL].

This eliminates k=2 from S467. Only k=4 remains. CRUS had previously searched k=2 to n=100K.

[QUOTE=gd_barnes;250560]Ingo Buechel, Wilfred Keller, and David Broadhurst found:

2*467^126775+1 is prime

See [URL]http://primes.utm.edu/primes/page.php?id=97818[/URL].

This eliminates k=2 from S467. Only k=4 remains. CRUS had previously searched k=2 to n=100K.[/QUOTE]
Hmm, that's got to be one of the most ironic incidences in all of recent prime-search history: someone finds a megabit non-power-of-2 prime (back when non-power-of-2's were much slower to test, no less!) and doesn't notice it for two years! :shock:

This sounds like it would be an interesting base to try to finish off k=4 on, just because it would be kind of neat. :smile: I might take a whack at it myself. Gary, would you by chance be willing to sieve this one for n=100K-150K for me, or is your i7 fully booked with other work?

S1029
 

34*1029^106501+1 is prime.

Conjecture proven.

[QUOTE=mdettweiler;250566]Hmm, that's got to be one of the most ironic incidences in all of recent prime-search history: someone finds a megabit non-power-of-2 prime (back when non-power-of-2's were much slower to test, no less!) and doesn't notice it for two years! :shock:

This sounds like it would be an interesting base to try to finish off k=4 on, just because it would be kind of neat. :smile: I might take a whack at it myself. Gary, would you by chance be willing to sieve this one for n=100K-150K for me, or is your i7 fully booked with other work?[/QUOTE]

My I7 is booked for about 2 more weeks with Riesel-Sierp base 2 even k followed by Riesel-Sierp base 16.