Congrats to you both!:smile:

Wow :)

Looks like we are getting MORE primes instead of less :>

Congrats to you both!

(This makes the n=2M-10M file only have 26.6M candidates...)

i found this on free-dc forum ... no annoucement here so i post it here

[QUOTE=PCZ]Lucky me

[url]http://primes.utm.edu/primes/page.php?id=78896[/url]
[url]http://primes.utm.edu/primes/page.php?id=78897[/url]

Two in one day [/QUOTE]

Thanks Laurent,

Here are those recent finds:

139394*5^145425+1 PCZ 24 Nov 2006
99784*5^145804+1 PCZ 24 Nov 2006

:furious: :furious:

101284*5^92044+1 is prime!

Oh well! Another heavy weight k bites the dust :grin:

Congrats to PCZ :victor:

A new 262-k dat file coming up.

nice nice! :smile:

[QUOTE=axn1;92336]:furious: :furious:

101284*5^92044+1 is prime!

Oh well! Another heavy weight k bites the dust :grin:

Congrats to PCZ :victor:

A new 262-k dat file coming up.[/QUOTE]

congrats to PCZ !

but it's a lot lower than the actual range ... so wouldn't it be a good idea to do the same thing than with riesel part: checking all values below 100000 now then start again at actual range :question:

it will probably save a lot of test. (in this case, all test from 92045 to 140000 are almost useless)

[QUOTE=tnerual;92359]but it's a lot lower than the actual range ... so wouldn't it be a good idea to do the same thing than with riesel part: checking all values below 100000 now then start again at actual range :question: [/QUOTE]
It has already been done (quite recently, actually) :geek: Take a look at this page [url]http://www.sr5.psp-project.de/r5stats.html[/url] -- look at the bottom of the page at [B]Open n per block[/B], you'll see that almost all k/n pairs below 150,000 have been tested at least once.

PS:- The reason we weren't in a rush to finish these low n tests earlier was because these were tested once before, outside of LLRNet, (we just didn't have the residues). So to find a prime in the lower ranges was a bit of a surprise :ermm:

[QUOTE=axn1;92361]It has already been done (quite recently, actually) :geek: Take a look at this page [url]http://www.sr5.psp-project.de/r5stats.html[/url] -- look at the bottom of the page at [B]Open n per block[/B], you'll see that almost all k/n pairs below 150,000 have been tested at least once.

PS:- The reason we weren't in a rush to finish these low n tests earlier was because these were tested once before, outside of LLRNet, (we just didn't have the residues). So to find a prime in the lower ranges was a bit of a surprise :ermm:[/QUOTE]

i mean do the same with sierpinski.:wink:

i know we have done that with riesel (due to the old 150000 limitation), i just suggest to do it with riesel (with heavy hitter like pcz and birdmann, it take only 1 or 2 day and everything is clear ...)

Think he means, to do the same on the Sierpinski side ;)
Maybe there is another 1 or 2 primes? And I think he is right, that we can do this in a few days.
Also, it looks better in the stats, when there are 0 tests left, with n < 100000 :smile:

correction (can't edit anymore:sad: )
[QUOTE=tnerual;92373]i mean do the same with sierpinski.:wink:

i know we have done that with riesel (due to the old 150000 limitation), i just suggest to do it with [COLOR="Red"]sierpinski[/COLOR] (with heavy hitter like pcz and birdman, it take only 1 or 2 day and everything is clear ...)[/QUOTE]

thanks xentar :wink: