Sierpinski even n's
 

Hi,

Please, would you again reserve k=60849 for me ; I want to continue to test it starting now from n=2,000,000 base two.

Thanks by advance and Best Regards,

Jean

P.S. k=23451 is now tested up to 2,050,000 base two ; no prime, continuing...

Status for Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 2,103,728 base two, no prime, continuing...
k = 60849 is tested up to n = 2,100,294 base two, no prime, continuing...

Regards,
Jean

PS : k=23451 is now sieved up to 79.45 T and k=60849 up to 106.26 T

[QUOTE=Jean Penné;321065]k=23451 is now sieved up to 79.45 T and k=60849 up to 106.26 T[/QUOTE]

Can I ask why these are being sieved separately? Isn't it faster using 1 instance of sr2sieve rather than 2 instances of sr1sieve?

[QUOTE=rogue;321088]Can I ask why these are being sieved separately? Isn't it faster using 1 instance of sr2sieve rather than 2 instances of sr1sieve?[/QUOTE]

I am not sure... sr1sieve_64-linux is very fast, and above all, I am sieving and testing on the same file, using the Increasing_ns=1 feature of LLR on each of the two machines used.

[QUOTE=rogue;321088]Can I ask why these are being sieved separately? Isn't it faster using 1 instance of sr2sieve rather than 2 instances of sr1sieve?[/QUOTE]

I think it's about the same for 2 k's. For 3 k's sr2sieve is definitely faster.

k=9519 tested n=6M to 7M, nothing. Continuing.

k=9267 completed to n=4M, need more sieving files.
Results attached.

Status for Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 2,246,684 base two, no prime, continuing...
k = 60849 is tested up to n = 2,200,266 base two, no prime, continuing...

Regards,
Jean

P.S. I am now using sr2sieve-x86_64-linux and the two files are now sieved up to 118.74 T

Sierpinski even n's ; Presieved files updated
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 2,302,304 base two, no prime, continuing...
k = 60849 is tested up to n = 2,250,234 base two, no prime, continuing...


Regards,
Jean

P.S. The two files are now sieved up to 132.69 T
Other active Liskovets-Gallot presieved files are now updated on :
[url]http://jpenne.free.fr/ConjRus/[/url]
They are sieved up to 75.32 T

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 2,408,228 base two, no prime, continuing...
k = 60849 is tested up to n = 2,348,934 base two, no prime, continuing...


Regards,
Jean
P.S. The two files are now sieved up to 163.60 T

Sierpinski odd n's counterparts for 23451 and 60849
 

Hi,

To satisfy my curiosity, I am also sieving and testing these two k values for odd n's. For now, my results follow :

23451*2^n+1 is prime for odd n's :

43,75,147,163,197,203,709,973,1503,20635,32333,36045,42623,67103,186837,215203

60849*2^n+1 is prime for odd n's :

9,129,147,181,225,337,549,597,1177,1327,2685,11019,18397,19539,66889,77959,90405,95647,97497,246691

All these primes are now too small to be archived, but one of them had been archived in 2001 :

60849*2^90405+1 g182, McElhatton, Proth.exe, March 2001, 27220 digits.

Regards,
Jean

[QUOTE=Jean Penné;336121]Hi,

To satisfy my curiosity, I am also sieving and testing these two k values for odd n's. For now, my results follow :

23451*2^n+1 is prime for odd n's :

43,75,147,163,197,203,709,973,1503,20635,32333,36045,42623,67103,186837,215203

60849*2^n+1 is prime for odd n's :

9,129,147,181,225,337,549,597,1177,1327,2685,11019,18397,19539,66889,77959,90405,95647,97497,246691

All these primes are now too small to be archived, but one of them had been archived in 2001 :

60849*2^90405+1 g182, McElhatton, Proth.exe, March 2001, 27220 digits.

Regards,
Jean[/QUOTE]

08/04/13 :
60849*2^390015+1 is prime! (117411 decimal digits) Time : 637.580 sec.

[QUOTE=Jean Penné;336760]08/04/13 :
60849*2^390015+1 is prime! (117411 decimal digits) Time : 637.580 sec.[/QUOTE]

Every time I see you post in this thread I'm hoping to see that you found a prime for one of those two k. I see you found one, but not for an even n. :ick:

even n's / odd n's for the two k's
 

[QUOTE=rogue;336765]Every time I see you post in this thread I'm hoping to see that you found a prime for one of those two k. I see you found one, but not for an even n. :ick:[/QUOTE]
I am now sieving and testing (separately) k = 23451 and k = 60849 both for even and for odd n's, because I think it is interesting to see the strong dissymetry on the results... But I will be now more explicit while presenting these results, to avoid you to be disappointed!
Regards,
Jean

[QUOTE=unconnected;322255]k=9267 completed to n=4M, need more sieving files.
Results attached.[/QUOTE]

Ian,

Can you send Dmitry a PrimeGrid sieve file for Sierp base 2 k=9267 for n=4M-6M? If you can filter out only the odd n, that would help him but if not, I'm sure that he could do that. Even if PrimeGrid is still sieving it, it's probably sieved more than any file that we have.

Thanks!


Gary

[QUOTE=gd_barnes;338679]Ian,

Can you send Dmitry a PrimeGrid sieve file for Sierp base 2 k=9267 for n=4M-6M? If you can filter out only the odd n, that would help him but if not, I'm sure that he could do that. Even if PrimeGrid is still sieving it, it's probably sieved more than any file that we have.[/QUOTE]

Ian, I have a special version of srfile that can extract all n for a list of k from PrimeGrid's files. It isn't smart enough to remove odd or even n all at once, but it could do that with a couple of extra steps.

[QUOTE]
Can you send Dmitry a PrimeGrid sieve file for Sierp base 2 k=9267 for n=4M-6M? If you can filter out only the odd n, that would help him but if not, I'm sure that he could do that. Even if PrimeGrid is still sieving it, it's probably sieved more than any file that we have.
[/QUOTE]

I'm not sure I have the latest file but I'm sure it's available at Lennart's site.

[QUOTE]Ian, I have a special version of srfile that can extract all n for a list of k from PrimeGrid's files. It isn't smart enough to remove odd or even n all at once, but it could do that with a couple of extra steps. [/QUOTE]

Thanks Mark, but I have a homegrown script for doing the extract and the odd n's. It's amazing what you accumulate over the years.

I just realized that I don't have the Prime Grid sieve files for >3M. Where can I get them? Lennart only has the RPS files.

[QUOTE=MyDogBuster;338705]I just realized that I don't have the Prime Grid sieve files for >3M. Where can I get them? Lennart only has the RPS files.[/QUOTE]

I don't know.

[url]http://home.comcast.net/~jimb_primegrid/rsp/[/url]

[QUOTE=pinhodecarlos;338739][URL]http://home.comcast.net/~jimb_primegrid/rsp/[/URL][/QUOTE]


Wrong files...

Lennart

[QUOTE=MyDogBuster;338705]I just realized that I don't have the Prime Grid sieve files for >3M. Where can I get them? Lennart only has the RPS files.[/QUOTE]
You can always make own sieve :)
But if you dont have it from Lennart, then there is NO other way...

[QUOTE=pepi37;338780]You can always make own sieve :)
But if you dont have it from Lennart, then there is NO other way...[/QUOTE]


He have what he need now. :smile:

Lennart

Can I have it also?

[QUOTE]
Can you send Dmitry a PrimeGrid sieve file for Sierp base 2 k=9267 for n=4M-6M?[/QUOTE]

Done

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 2,540,012 base two, no prime, continuing...
k = 60849 is tested up to n = 2,468,070 base two, no prime, continuing...


Regards,
Jean
P.S. The two files are now sieved up to 202.12 T

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 2,612,012 base two, no prime, continuing...
k = 60849 is tested up to n = 2,528,490 base two, no prime, continuing...


Regards,
Jean
P.S. The two files are now sieved up to 222.48 T

R2 k=9519 tested n=7M to 8M, no prime. Continuing...

k=9267 completed to n=6M. Results attached.

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 2,711,048 base two, no prime, continuing...
k = 60849 is tested up to n = 2,614,554 base two, no prime, continuing...


Regards,
Jean
P.S. The two files are now sieved up to 251.90 T

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 2,811,344 base two, no prime, continuing...
k = 60849 is tested up to n = 2,700,306 base two, no prime, continuing...


Regards,
Jean
P.S. The two files are now sieved up to 283.73 T

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 2,921,668 base two, no prime, continuing...
k = 60849 is tested up to n = 2,802,810 base two, no prime, continuing...


Regards,
Jean
P.S. The two files are now sieved up to 328 T

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 3,030,668 base two, no prime, continuing...
k = 60849 is tested up to n = 2,903,130 base two, no prime, continuing...


Regards,
Jean
P.S. The two files are now sieved up to 370 T

R2, k=9519 tested n=8M-9M, no prime. Continuing...

[QUOTE=Puzzle-Peter;368319]R2, k=9519 tested n=8M-9M, no prime. Continuing...[/QUOTE]

Shoot, this is an unsorted file. Sorry for that! Will post a clean file tomorrow

[QUOTE=Puzzle-Peter;368340]Shoot, this is an unsorted file. Sorry for that! Will post a clean file tomorrow[/QUOTE]

No problem. BTW, what sieve file will you be using for n>9M? I think that PrimeGrid's file only goes to n=9M. If you need a file, our current sieving drive has k=9519 in it and is being sieved for all n<16777216. It's current sieve depth is P=300T and the latest file with all factors removed is posted there. It's not PrimeGrid depth but 300T is pretty significant.

[QUOTE=gd_barnes;368378]No problem. BTW, what sieve file will you be using for n>9M? I think that PrimeGrid's file only goes to n=9M. If you need a file, our current sieving drive has k=9519 in it and is being sieved for all n<16777216. It's current sieve depth is P=300T and the latest file with all factors removed is posted there. It's not PrimeGrid depth but 300T is pretty significant.[/QUOTE]

First I used Jean's file, then I switched to the Prime Grid sieve file. I don't remember if I replaced n<9M or if the Prime Grid sieve file went further. Anyway, the file I am using goes up to n<16777216.

Here's n=8M-9M without all the junk:

[QUOTE=Puzzle-Peter;368407]First I used Jean's file, then I switched to the Prime Grid sieve file. I don't remember if I replaced n<9M or if the Prime Grid sieve file went further. Anyway, the file I am using goes up to n<16777216.

Here's n=8M-9M without all the junk:[/QUOTE]

That means you're using Jean's file for n>9M (unless PrimeGrid has started sieving n>9M unbeknownst to me). We've now sieved it to P=300T. I don't think Jean has sieved that high. You might want to check our file from the sieving drive and see if it has fewer tests than the one that you are using. Here is a link:
[URL]http://www.noprimeleftbehind.net/crus/sieve-riesel-sierp-even-odd-k-n.zip[/URL]

The sieving drive is still ongoing. Each time that you complete an n=1M range, you might check back on the above link to see if you can save some more tests. The sieve depth at the top will always be correct. I update it with each P=30T sieving range that is completed.

[QUOTE=gd_barnes;368420]You might want to check our file from the sieving drive and see if it has fewer tests than the one that you are using. Here is a link:
[URL]http://www.noprimeleftbehind.net/crus/sieve-riesel-sierp-even-odd-k-n.zip[/URL]
[/QUOTE]

I'll have a look at it, thanks!

I compared the files and found mine to have less candidates. Now that I think about it I seem to remember I sieved to p=700T (only for k=9519). Unfortunately I didn't keep the records as I decided that was as high as I would ever sieve this range.

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 3,136,472 base two, no prime, continuing...
k = 60849 is tested up to n = 3,000,966 base two, no prime, continuing...


Regards,
Jean
P.S. The two files are now sieved up to 413 T

Sierpinski even n's
 

09/06/2014, 11H30
Success at last!
I found :
60849*2^3067914+1 is prime! Time : 11623.254 sec.
Primality Testing of k*b^n+/-1 Program - PC/MacIntel Version 3.8.8 (Linux llr64)
I verified :
60849*2^3067914+1 is prime! (923539 decimal digits) Time : 9139.041 sec.
Primality Testing of k*b^n+/-1 Program - beta Version 3.8.13 (Linux llr64)

CPU Information:
AMD Phenom(tm) II X4 965 Processor
CPU speed: 3411.23 MHz
CPU features: RDTSC, CMOV, PREFETCH, MMX, SSE, SSE2
L1 cache size: 64 KB
L2 cache size: 512 KB

So, for now, this conjecture has one k remaining :

k=23451 is tested up to n = 3213008 base 2, no prime, continuing...
The corresponding files are sieved up to 446.6 T
Indeed, I shall send the positive result to Chris Caldwell.
Best Regards,
Jean

Congratulations! Almost 1M-digit prime! :smile:

[QUOTE=Jean Penné;375396]09/06/2014, 11H30
Success at last!
I found :
60849*2^3067914+1 is prime! Time : 11623.254 sec.
Primality Testing of k*b^n+/-1 Program - PC/MacIntel Version 3.8.8 (Linux llr64)
I verified :
60849*2^3067914+1 is prime! (923539 decimal digits) Time : 9139.041 sec.
Primality Testing of k*b^n+/-1 Program - beta Version 3.8.13 (Linux llr64)

CPU Information:
AMD Phenom(tm) II X4 965 Processor
CPU speed: 3411.23 MHz
CPU features: RDTSC, CMOV, PREFETCH, MMX, SSE, SSE2
L1 cache size: 64 KB
L2 cache size: 512 KB

So, for now, this conjecture has one k remaining :

k=23451 is tested up to n = 3213008 base 2, no prime, continuing...
The corresponding files are sieved up to 446.6 T
Indeed, I shall send the positive result to Chris Caldwell.
Best Regards,
Jean[/QUOTE]

Wow! That is CRUS's largest prime to date!! A huge congrats!

:skiing::banana::groupwave::bow wave::party::chalsall::george:

Great find!

Which of the two k has a higher Proth weight?

[QUOTE=rogue;375403]Great find!

Which of the two k has a higher Proth weight?[/QUOTE]

The remaining k=23451 has a weight of 260. Now primed k=60849 had a weight of 315.

k=23451 has now been added in the one-k remaining thread.

[QUOTE=gd_barnes;375402]Wow! That is CRUS's largest prime to date!! A huge congrats!

:skiing::banana::groupwave::bow wave::party::chalsall::george:[/QUOTE]

Thanks! Note that this is also a nice success for the Sierpinski base 4 project that was launched by Citrix in January 2005 : this project has now only 3 k's remaining! It means we are right to persever...

Jean

Followup question for Jean. How many cores do you have PRP testing this conjecture?

[QUOTE=rogue;375434]Followup question for Jean. How many cores do you have PRP testing this conjecture?[/QUOTE]

Three cores, until this morning : one for the sieving with sr2sieve-x86_64-linux,
one for the primality testing of 23451*4^n+1 and one for the testing of 60849*4^n+1. Two cores only, now!

Jean

[QUOTE=Jean Penné;375396]09/06/2014, 11H30
Success at last!
I found :
60849*2^3067914+1 is prime! Time : 11623.254 sec.
Primality Testing of k*b^n+/-1 Program - PC/MacIntel Version 3.8.8 (Linux llr64)
I verified :
60849*2^3067914+1 is prime! (923539 decimal digits) Time : 9139.041 sec.
Primality Testing of k*b^n+/-1 Program - beta Version 3.8.13 (Linux llr64)

CPU Information:
AMD Phenom(tm) II X4 965 Processor
CPU speed: 3411.23 MHz
CPU features: RDTSC, CMOV, PREFETCH, MMX, SSE, SSE2
L1 cache size: 64 KB
L2 cache size: 512 KB

So, for now, this conjecture has one k remaining :

k=23451 is tested up to n = 3213008 base 2, no prime, continuing...
The corresponding files are sieved up to 446.6 T
Indeed, I shall send the positive result to Chris Caldwell.
Best Regards,
Jean[/QUOTE]

Congratulations Jean!

R2, k=9519 tested for n=9M to 10M, no prime. Continuing to 11M...

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 3,328,532 base two (1,001,993 decimal digits), no prime, continuing...


Regards,
Jean
P.S. The file is now sieved up to 540 T

I am pleased to announce that PRPnet port 1400 has now been loaded with well-sieved (P=550T) candidates for Riesel-Sierp base 2/4 even-odd k-n. For now, 15 k's for n=2M-2.5M are loaded. (3 other k's are reserved and/or tested to a higher n-range.) As we continue to sieve, we will load higher n-ranges.

Everyone fire away as we attempt to bring our base 2 efforts closer to the search range of other project's efforts. :smile:

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 3,400,144 base two (1,023,550 decimal digits), no prime, continuing...


Regards,
Jean
P.S. The file is now sieved up to 596 T

[URL]http://mersenneforum.org/showpost.php?p=385642&postcount=363[/URL]

3 k's now remain for Sierp base 2 odd-n. :smile:

155877*2^2273465-1
[URL]http://www.noprimeleftbehind.net:1400/user_primes.html[/URL]
Another one eliminated by Gary, congratulations!

Wow!! Congratulations Gary! lol
:banana:

Thanks for letting me know Dmitry. It is now reported. I'm out of town on business for 3 weeks and just logged on today to check things. With about a 1/30,000 chance of each test being prime on port 1400 and 2 primes already found, we're definitely doing much better than expected.

Third highest weighted k. That will save about 5300 tests.

Nice one Gary:smile::smile:

R2, k=9519 tested for n=10M to 11M, no prime. Continuing to 12M...

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 3,500,108 base two (1,053,642 decimal digits), no prime, continuing...


Happy New Year to all prime number hunters, and Best Regards,
Jean
P.S. The file is now sieved up to 698 T

Sierpinski even n's
 

Hi,

Here is my status today :

k = 23451 is tested up to n = 3,600,208 base two (1,083,775 decimal digits), no prime, continuing...


Best Regards,
Jean
P.S. The file is now sieved up to 791 T

19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever! :banana:

[QUOTE=gd_barnes;403997]19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever! :banana:[/QUOTE]

Good one!

[QUOTE=gd_barnes;403997]19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever! :banana:[/QUOTE]

Congratulations!
Nice one!
:groupwave:

[QUOTE] Originally Posted by [B]gd_barnes[/B]
[I]19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever! :banana:[/I]
[/QUOTE]2 hits in 1 at bat. Not bad. We may even solve one of this even-odd thingys someday. Nice:bow:

[QUOTE=gd_barnes;403997]19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever! :banana:[/QUOTE]

Carefull, the next one might be Mega :wink: :max:

Congratulation on a nice find, now there remains exactly 170 k's for SR 2, 4, 8, 16, 32, 64, 128, 256, 512 and 1024 and only 4 more Riesel k primes then a nice round 100 Riesel (base 2 or power of 2) k's remain b<=1024 :smile:

Nice success, Gary!
 

[QUOTE=gd_barnes;403997]19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever! :banana:[/QUOTE]

Many congrats, Gary, for this nice success!

Here is my present status for Sierpinski even n's :

k = 23451 is tested up to n = 3,706,628 base two (1,116,053 decimal digits), no prime, continuing, perhaps still for a long time...
but, as you saw, we may be rewarded for our patience!
Best Regards,
Jean
P.S. The file is now sieved up to 880 T

[QUOTE=gd_barnes;403997]19401*2^3086450-1 is prime!

This also knocks out the same k for base 4.

Riesel base 2 even-n is down to 2 k's remaining.

My largest prime ever! :banana:[/QUOTE]
A belated congrats...glad to see another of these knocked out (especially two at once)! :w00t:

A Liskovets-Gallot theorem proven!
 

02/08/2015,
The Liskovets-Gallot conjecture for Proth numbers and even exponents becomes a theorem!
I found :
Starting Proth prime test of 23451*2^3739388+1 (1125673 decimal digits)
Using all-complex AMD K10 FFT length 320K, Pass1=256, Pass2=1280, a = 5
23451*2^3739388+1 is prime! (1125673 decimal digits) Time : 15201.590 sec.
LLR Program - Version 3.8.16, using Gwnum Library Version 28.7
CPU Information:
AMD Phenom(tm) II X4 965 Processor
CPU speed: 3411.23 MHz
CPU features: RDTSC, CMOV, PREFETCH, MMX, SSE, SSE2
L1 cache size: 64 KB
L2 cache size: 512 KB

03/08/2015,
I verified (with a 32bit machine):
Starting Proth prime test of 23451*2^3739388+1
Using all-complex AMD K8 FFT length 320K, Pass1=256, Pass2=1280, a = 5
23451*2^3739388+1 is prime! (1125673 decimal digits) Time : 63583.482 sec.
CPU Information:
AMD Sempron(tm) Processor 3000+
CPU speed: 1004.70 MHz
CPU features: RDTSC, CMOV, PREFETCH, MMX, SSE, SSE2
L1 cache size: 64 KB
L2 cache size: 128 KB

This is also my first megaprime, and a nice present for a week after my 80th birthday!
Best Regards,
Jean

Very nice find, congratulations!

:bow wave:

WOW. One of those even-odd thingys is solved. Nice Jean Happy-B'day:party:

Jean, congrats on finding your first mega-prime :banana:

Jean, congratulations!
:victor::victor::victor::victor:

A huge congrats Jean! Amazing work!

:bow wave:

[QUOTE=gd_barnes;407205]A huge congrats Jean! Amazing work!

:bow wave:[/QUOTE]

Thanks, Gary, and thanks to all!
Indeed, after your last success with Riesel numbers, and after this last one, the search for solving Liskovets-Gallot conjectures becomes really exciting!
About that, I have two questions :

1) I just see that the Liskovets-Gallot page in [url]http://www.rieselprime.de[/url] has not been updated since November 2011...
Is it still possible to ask to Karsten to do this updating? It would be really great, because huge progresses have been done, that are not shown...
2) Is it possible that I reserve now again the two Sierpinski odd n's candidates k=9237 and k=32247?
Finding a prime for these two k value would terminate the Sierpinski base 4 search, and make another LG conjecture with one k remaining!

Best Regards,
Jean

[QUOTE=Jean Penné;407214]2) Is it possible that I reserve now again the two Sierpinski odd n's candidates k=9237 and k=32247?
Finding a prime for these two k value would terminate the Sierpinski base 4 search, and make another LG conjecture with one k remaining!

Best Regards,
Jean[/QUOTE]

k=32247 at n=3.15M is being searched on our PRPnet port 1400. k=9267 at n=6M is available.

[QUOTE=gd_barnes;407330]k=32247 at n=3.15M is being searched on our PRPnet port 1400. k=9267 at n=6M is available.[/QUOTE]
Thanks for the info, so, I will reserve only k=9267.
Regards,
Jean

[QUOTE=unconnected;407150]Very nice find, congratulations!

:bow wave:[/QUOTE]

Thank you!
As you can see, I will now reserve k=9267 that you tested for odd n's up to 6M.
Please would you tell me up to what P value the sieved file you used was sieved, and if it contains
exponents larger than 6M? If no, I will sieve from scratch...

Best Regards,
Jean

[QUOTE=Jean Penné;407386]Thank you!
As you can see, I will now reserve k=9267 that you tested for odd n's up to 6M.
Please would you tell me up to what P value the sieved file you used was sieved, and if it contains
exponents larger than 6M? If no, I will sieve from scratch...

Best Regards,
Jean[/QUOTE]

I received sieve file from Lennart, sieve depth was 400P (done by Primegrid). 6M-9M range sieved now to p=~103P. Primegrid does not provide sieve files for +1 side for some reasons, but I think you can contact [URL="http://www.mersenneforum.org/member.php?u=5865"]Lennart[/URL] or [URL="http://www.mersenneforum.org/member.php?u=13314"]JimB[/URL] and receive it for k=9267.

Good luck in your search!

Lennart is out of reach and I suspect something bad happened.:cry:

[url]http://www.primegrid.com/forum_thread.php?id=6236[/url]

If you're unable to get the k=9267 file, I have one but not sieved nearly as deeply. Our sieving drive sieved all base 2 odd/even/k's/n's for n=1M-16777216 to P=700T. Hopefully you can get ahold of the PrimeGrid file which is sieved > 100x more.

[QUOTE=gd_barnes;407425]If you're unable to get the k=9267 file, I have one but not sieved nearly as deeply. Our sieving drive sieved all base 2 odd/even/k's/n's for n=1M-16777216 to P=700T. Hopefully you can get ahold of the PrimeGrid file which is sieved > 100x more.[/QUOTE]

Many thanks, Gary!
I got the sieved file up to 760T from your drive, and will use it for k=9267 by LLR testing and sieving it upper whith a second core.
Best Regards,
Jean

R2, k=9519 tested n=11M to 12M, nothing. Continuing...

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to 6,100,663 no prime, continuing...

Please note I am now happy to use the deeply sieved file sent to me by PrimeGrid, many thanks!
Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to 6,201,103 no prime, continuing...

Regards,
Jean

R2
 

R2, k=9519 tested n=12M to 12.5M, no prime. Continuing...

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 6,313,495 no prime, continuing...

Regards,
Jean

R2, k=9519 tested 12.5M to 13.5M, no prime. Continuing...

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 6,400,543 no prime, continuing...

Regards,
Jean

R2, k=9519, tested n=13.5M to 14M. No prime, continuing...

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 6,500,335 no prime, continuing...

Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 6,601,063 no prime, continuing...

Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 6,700,063 (2,016,924 decimal digits) no prime, continuing...

Regards,
Jean

Congratulations to all finders of the remainings in the Liskovets-Gallot Conjectures.

3 conjectrues to go, 1 done
9 primes to go

I've updated the related page on rieselprime with data from this thread.

Sierpinski odd n's testing
 

Hi,

Many thanks to Karsten for updating his page!

k=9267 is now tested up to n = 6,801,175 (2,047,362 decimal digits) no prime, continuing...

Happy new year for all and Best Regards,
Jean

[QUOTE=kar_bon;448436]Congratulations to all finders of the remainings in the Liskovets-Gallot Conjectures.

3 conjectrues to go, 1 done
9 primes to go

I've updated the related page on rieselprime with data from this thread.[/QUOTE]

Link to page is?

[QUOTE=pepi37;450575]Link to page is?[/QUOTE]

[url]https://www.rieselprime.de/[/url]

Jean