Sorry, I forgot to mention that I am continuing k=9519 :smile:

Restarting the sieves!
 

Hi,

If I am not wrong, all n's <= 2M base two have now been tested for this project. So, the corresponding minidrive has been stopped...

Nevertheless, I hope the proving of the four Liskovets-Gallot conjectures has not been abandoned, so I am restarting the sieving of the 14 files for which no prime has yet been found... Presently, they are sieved up to 50 Tera, and will be updated from time to time on this personal page :

[url]http://jpenne.free.fr/ConjRus/[/url]

Please, let me know if it may be useful...

- Note that the option -oRising_n's=1 is available on the development version of LLR 3.8.6, so, you have not to worry about small n's dropped while using an updated sieved file! (indeed, you have then also to set -oLast_Processed_n=<number> the first time).

Best Regards,
Jean

P.S. I am not sure the Liskovets-Gallot page or RPS is up to date, because it still shows reservations for n's < 2M!

[QUOTE=Jean Penné;279568]Nevertheless, I hope the proving of the four Liskovets-Gallot conjectures has not been abandoned, so I am restarting the sieving of the 14 files for which no prime has yet been found... Presently, they are sieved up to 50 Tera, and will be updated from time to time on this personal page :
[/QUOTE]

Jean, I am working on k=9519 and I sieved it much higher than 50T. So don't bother with that one!

Peter

[QUOTE=Jean Penné;279568]I am not sure the Liskovets-Gallot page or RPS is up to date, because it still shows reservations for n's < 2M![/QUOTE]

Karsten,

Can you bring the Liskovets-Gallot page up to date? Thanks.


Gary

[QUOTE=Puzzle-Peter;279592]Jean, I am working on k=9519 and I sieved it much higher than 50T. So don't bother with that one!

Peter[/QUOTE]

Thanks for this info, I will delete it from my sieve!
Jean

[QUOTE=Puzzle-Peter;279592]Jean, I am working on k=9519 and I sieved it much higher than 50T. So don't bother with that one!

Peter[/QUOTE]

I think I better get a clarification for both Jean and me so that nothing gets missed. Are you sieving his entire file higher? I believe his file includes all n<=16.6M or something like that. I ask because he includes the entire file in his sieving.


Gary

[QUOTE=gd_barnes;279687]I think I better get a clarification for both Jean and me so that nothing gets missed. Are you sieving his entire file higher? I believe his file includes all n<=16.6M or something like that. I ask because he includes the entire file in his sieving.


Gary[/QUOTE]

I took the file for k=9519, P=50T from Jean's page and continued sieving it. So it is only this one k I am sieving and testing.

[QUOTE=Puzzle-Peter;279733]I took the file for k=9519, P=50T from Jean's page and continued sieving it. So it is only this one k I am sieving and testing.[/QUOTE]

What I meant is: Are you sieving ALL of k=9519 and not just say...n=2M-5M? It sounds like you are so that is good.

[QUOTE=gd_barnes;279734]What I meant is: Are you sieving ALL of k=9519 and not just say...n=2M-5M? It sounds like you are so that is good.[/QUOTE]

Yes, I am.

[QUOTE=gd_barnes;279595]Karsten, Can you bring the Liskovets-Gallot page up to date? Thanks.
[/QUOTE]

Done.

k=9519, 3M<n<4M tested, no prime.

Continuing to n=5M...