No, I'm not talking about reservations here. You can reserve any k you want in any base. You can reserve as many k's or bases that you can test! :smile: I'm only referring to POSTING of primes and ranges completed.

I'm saying that when you and Karsten post a prime or a range completed, please just post it in the format of the Conjectured k, base, and exponent and leave out forms of the primes and ranges that don't pertain the specific conjecture(s).

Here's an example on Karsten's post:

[quote]
198726*2^268878-1 = 198726*4^134439-1 = 99363*2^268879-1

and today

260934*2^273436-1 = 260934*4^136718-1 = 130467*2^273437-1

so there're 13 k's remaining!

by now all these 13 k's tested upto n=274,000 -> odd n=137,000!
[/quote]


My question is why are we showing 3 different forms of the same prime? These k's are not remaining for anything else except riesel odd-n. So...what I'm asking is that we keep the prime and ranges posts short and simple with:

[quote]
99363*2^268879-1 is prime

and today
130467*2^273437-1 is prime

so there're 13 k's remaining!

all these 13 k's now tested up to n=274,000
[/quote]


In this case, we are not testing even k's, we're not testing even n's, and we're not testing base 4. We're just testing Riesel base 2 odd-n.

So there's no reason to state the even k's, even n's, or base 4 forms of the primes.

Now...if one test covers more than one base or conjecture, THEN it makes sense to state them in more than one way. For instance k=9519 for base 2 even-n and for base 4.

I hope this clarifies the request.

Please know that this isn't a requirement...it's only a suggestion. I'm asking because I've actually posted the incorrect n-value for a prime on my pages when reading one of these previously. I then caught it the next day.

Also, I would never limit anyone from searching anything as long as they are providing regular updates. That's the fastest way to lose people from a project.


Thanks,
Gary

[QUOTE=gd_barnes;130451]No, I'm not talking about reservations here. You can reserve any k you want in any base. You can reserve as many k's or bases that you can test! :smile: I'm only referring to POSTING of primes and ranges completed.

I'm saying that when you and Karsten post a prime or a range completed, please just post it in the format of the Conjectured k, base, and exponent and leave out forms of the primes and ranges that don't pertain the specific conjecture(s).

Here's an example on Karsten's post:




My question is why are we showing 3 different forms of the same prime? These k's are not remaining for anything else except riesel odd-n. So...what I'm asking is that we keep the prime and ranges posts short and simple with:




In this case, we are not testing even k's, we're not testing even n's, and we're not testing base 4. We're just testing Riesel base 2 odd-n.

So there's no reason to state the even k's, even n's, or base 4 forms of the primes.

Now...if one test covers more than one base or conjecture, THEN it makes sense to state them in more than one way. For instance k=9519 for base 2 even-n and for base 4.

I hope this clarifies the request.

Please know that this isn't a requirement...it's only a suggestion. I'm asking because I've actually posted the incorrect n-value for a prime on my pages when reading one of these previously. I then caught it the next day.

Also, I would never limit anyone from searching anything as long as they are providing regular updates. That's the fastest way to lose people from a project.


Thanks,
Gary[/QUOTE]


O.K. I think it is now clear, and I agree with you about how to state the results.
It remains that the reserved ranges for each k might always be well known by all participants in order to avoid duplicate work, and it is not so easy to assert that always...
Jean

Riesel base 2 odd n
 

172167*2^282649-1 is prime!

[QUOTE=kar_bon;130534]172167*2^282649-1 is prime![/QUOTE]
Hurrah! 12 k's remaining!!
Jean

Riesel Base 2 even n's
 

I wish to reserve again k = 9519 (I already tested it up to n = 581680) for double-check, and then continuing further if necessary...

Regards,
Jean

[quote=Jean Penné;130992]I wish to reserve again k = 9519 (I already tested it up to n = 581680) for double-check, and then continuing further if necessary...

Regards,
Jean[/quote]

That would be a great k to find a prime for. It would remove it from Riesel base 2 even-n, base 4, base 16, AND base 256. I think that's the only k that hits 4 different bases.

It would be killing 4 birds with one stone. lol


Gary

Sierp base 2 odd-n status
 

For sierp base 2 odd-n, k=53133, 60357, 84363, and 85287 are now at n=500K. No more primes to report.

Along with this effort, I have been double-checking k=9267, 32247 for odd-n and k=23451 and 42717 for even-n. (k=42717 to see if there was a lower prime.) Please make note for any future double-checking effort that all 4 of these k's have been double-checked to n=500K.

Due to how much it is slowing down things, I am now stopping the double-checking and continuing on with just the 4 remaining Sierp odd-n k's up to n=600K.


Gary

Sierp base 2 even n's status
 

[QUOTE=gd_barnes;131277]For sierp base 2 odd-n, k=53133, 60357, 84363, and 85287 are now at n=500K. No more primes to report.

Along with this effort, I have been double-checking k=9267, 32247 for odd-n and k=23451 and 42717 for even-n. (k=42717 to see if there was a lower prime.) Please make note for any future double-checking effort that all 4 of these k's have been double-checked to n=500K.

Due to how much it is slowing down things, I am now stopping the double-checking and continuing on with just the 4 remaining Sierp odd-n k's up to n=600K.


Gary[/QUOTE]


Very nice work, Gary!
For even n's:

k = 60849 is now at n = 1,980,450 with no prime ; continuing up to 2M...

I am also continuing the big sieving on Sierp base 2 odd and even n's (8 k's)
up to n = 16M base 2 ; the sieve is now at p ~ 171.8 billions.
I shall put the 8 .npg files on my personal site when 200 billions reached.
Regards,
Jean

Updated status ; updated presieved files
 

Riesel even n's :

I double-checked k = 9519 up to n = 581680, finding no prime.

I continue testing : n is now up to 635800 with no prime found...

Riesel odd n's :

k = 148323 is now tested up to n = 651719 with no prime, continuing...

Sierpinski even n's :

k = 60849 is now at n = 1991190 with no prime ; a prime below 2M becomes now unlikely...

Presieved files :

All the files involved in the Liskovets-Gallot conjectures can be now downloaded from my personal site at URL :

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

I am continuing to sieve for all k's for which no prime is found, and the corresponding files are updated from time to time.
When a prime is found, the corresponding file is kept for double-checking purposes, but no more updated.

Regards,
Jean

The remaining 4 Sierp odd-n k's are now complete to n=600K. No additional primes were found.

I'm unreleasing these k's for now and if possible may assist in bringing some of the other Liskovets-Gallot conjectures up to n=500K or 600K.

Once we get all of the k's on the Liskovets-Gallot conjectures up to the same n-level (except the k's near n=2M), I think it'd be good to run them through an LLRnet server. What does everyone think of that?


Gary

Jean,

Without doing some detailed looking, how many k's are unreserved that you have sieved? Also, what n-value have you sieved them to and how deep were they sieved?

I will reserve all remaining unreserved k's to n=600K for the conjectures. I now have a full quad that I'll be able to put them on.


Gary

Presieved files
 

[QUOTE=gd_barnes;132623]Jean,

Without doing some detailed looking, how many k's are unreserved that you have sieved? Also, what n-value have you sieved them to and how deep were they sieved?

I will reserve all remaining unreserved k's to n=600K for the conjectures. I now have a full quad that I'll be able to put them on.


Gary[/QUOTE]

Gary,

I think the responses to your questions can all been found on my personal page at :

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

I am sieving all the k's involved by the conjectures and for which no prime is found ; the active files are updated from time to time on the site, and as their format is NewPGen, the first line shows how deep they are sieved.

When a prime is found, the file is neither more sieved nor updated, but remains available for double-check.

For the prime tests, here is my to-day's status :

Sierpinski even n's / base 4 :

k = 60849 is now tested up to 1999866 with no prime found, so, my 2M range is completed, and I release this k...
Note I have not been very lucky with Sierp. base 4, testing three k's during two years up to 2M without finding any prime... I hope these primes are not too far above this point!

Riesel even n's :

k = 9519 is up to 742816, no prime, continuing...

Riesel odd n's :

k = 148323 is up to 712247, no prime, continuing...

Regards,
Jean

Thanks for the response Jean. I need to go back through about 10 days worth of posts to get my web pages updated. I'll then post exactly all of the k's that I'm reserving.


Gary

[quote=gd_barnes;132623]Jean,

Without doing some detailed looking, how many k's are unreserved that you have sieved? Also, what n-value have you sieved them to and how deep were they sieved?

I will reserve all remaining unreserved k's to n=600K for the conjectures. I now have a full quad that I'll be able to put them on.


Gary[/quote]

As it turns out, there are few unreserved k's for these conjectures that are not already at n=600K but I'll reserve them to bring them up there:

Reserving Riesel base 2 odd-n k=39687, 133977, and 155877.

I'll take them from n=524K to 600K using Jean's sieved files.

Karsten, could you work towards getting your Riesel and Sierp even-n and odd-n conjectures reservations up to n=500K-600K? Or could I help with that?

Most beneficial to find primes for would be the 3 Riesel even-n k's, which would also knock out the same 3 k's on base 4 and 1 k on base 16.


Thanks,
Gary

[quote=gd_barnes;132714]As it turns out, there are few unreserved k's for these conjectures that are not already at n=600K but I'll reserve them to bring them up there:

Reserving Riesel base 2 odd-n k=39687, 133977, and 155877.

I'll take them from n=524K to 600K using Jean's sieved files.

Karsten, could you work towards getting your Riesel and Sierp even-n and odd-n conjectures reservations up to n=500K-600K? Or could I help with that?

[/quote]

i'm working still on all 11 odd k's (except 148323 for Jean), some doublechecking too,
currently at n=385k.
the 3 even k's the same, still testing.
both on a smaller machine so not much power by now.

see [URL]http://www.rieselprime.de/Related/LiskovetsGallot.htm[/URL]

[quote=kar_bon;132716]i'm working still on all 11 odd k's (except 148323 for Jean), some doublechecking too,
currently at n=385k.
the 3 even k's the same, still testing.
both on a smaller machine so not much power by now.

see [URL]http://www.rieselprime.de/Related/LiskovetsGallot.htm[/URL][/quote]

I'm confused. I don't see a reservation from you in this thread for the 3 k's that I reserved this morning, k=39687, 133977, and 155877. Also, those k's are past n=524K, which is why I reserved them from n=524K-600K.

So are you double-checking these 3 k's up to their current testing limit and then continuing with them? Also, can you tell me how far you're planning on taking all of the k's?

Edit: One final question: The last I had from you was n=379K on even-n and 301K on odd-n. So are BOTH even-n and odd-n at n=385K?


Thanks,
Gary

[QUOTE=gd_barnes;132735]I'm confused. I don't see a reservation from you in this thread for the 3 k's that I reserved this morning, k=39687, 133977, and 155877. Also, those k's are past n=524K, which is why I reserved them from n=524K-600K.
So are you double-checking these 3 k's up to their current testing limit and then continuing with them? Also, can you tell me how far you're planning on taking all of the k's?
[/QUOTE]

ok, i see.
in post #61 i mentioned all 13 k's tested up ton=274k and updated the page.
so to be official i'm testing 11 k's at once and those three as doublecheck.
so i can update that page reserving those 3 for you, Gary, and the rest with the new n-limit to me! i try to push all others k's to higher limits, about 500k or more.

[quote=kar_bon;132736]ok, i see.
in post #61 i mentioned all 13 k's tested up ton=274k and updated the page.
so to be official i'm testing 11 k's at once and those three as doublecheck.
so i can update that page reserving those 3 for you, Gary, and the rest with the new n-limit to me! i try to push all others k's to higher limits, about 500k or more.[/quote]

OK, I'll maintain the reservation from n=524K-600K on Riesel odd-n k=39687, 133977, and 155877. I'll put them on 1 high-speed core this evening. With such a small n-range on only 3 k's, it shouldn't take too long.

For final clarification, please re-verify the following:

These NINE k's are now at n=385K for FIRST-TIME testing:

even-n:
k=14361, 19401, and 20049

odd-n:
k=30003, 103947, 106377, 147687, 154317, and 163503


These FOUR k's are at n=385K for DOUBLE-CHECK testing:

odd-n:
k=6927, 39687, 133977, and 155877


Is that correct?


I realize I may be a little pushy here. The reason that I'm pushing these a little has somewhat to do with the base 4 and 16 conjectures. k=20049 for Riesel base 16 is the only k that is not at least at n=130K (n=520K base 2). It is only at n=96.25K base 16. Also, all 3 even-n k's above also remaining for Riesel base 4 and are the only k's for that base that are not at least at n=300K base 4 (n=600K base 2). They are only at n=192.5K base 4.

I'm trying to keep a close eye on k's that remain for more than one base because it's easy to get them out of sync with one another on the web pages. They just have more visibilitiy and are easier to get messed up in trying to avoid duplication of effort across bases.


Thanks again,
Gary

Riesel base 2 odd-n k=39687, 133977, and 155877 are now complete to n=642K and from n=650K-685K running on 2 cores.

I will go ahead and take these on up to n=800K using Jean's sieved files.


Gary

Karsten, since you are effectively double-checking Riesel base 2 odd-n k=6927, 39687, 133977, and 155877, I'll add to my reservation of the latter 3 k-values by reserving k=6927 from n=600K-1M. I may sieve Jean's file a little further first.

Finding a prime for k=6927 would knock it out of 2 or 3 bases simultaneously.


Gary

My to-day's status
 

Riesel even n's :

k = 9519 is up to 861880, no prime, continuing...

Riesel odd n's :

k = 148323 is up to 784631, no prime, continuing...

If necessary, I shall test these k's up to 1M, and then stop!

As a remainder :

Sierpinski even n's / base 4 :

k = 60849 is now tested up to 1999866 with no prime found, so, my 2M range is completed, and I release this k...
Note I have not been very lucky with Sierp. base 4, testing three k's during two years up to 2M without finding any prime... I hope these primes are not too far above this point!

Regards,
Jean

Updated presieved files
 

Hi,

I updated to-day all the presieved files on my site :

Riesel active files are now sieved up to more than 2000 billions.

Sierpinski active files are now sieved up to more than 675 billions.

Regards,
Jean

Riesel base 2 odd-n k=6927, 39687, 133977, and 155877 are now all at n=700K. No primes.

k=6927 is very low weight and is running on one core. The other 3 k's combined are running on one core. k=6927 should be hitting around n=1M about the same time that the others are hitting n=800K, which is how far I intend to take them at this point.

Sheesh...the even-n/odd-n conjectures have really dried up on primes!


Gary

Reserving Sierp odd-n k=53133, 60357, 84363, and 85287. I'll now take them up to n=800K.


Gary

Riesel even and odd n's status
 

Riesel even n's :

k = 9519 is up to n = 900472, no prime, continuing...

Riesel odd n's :

k = 148323 is up to n = 806903, no prime, continuing...

Regards,

Jean

Reserving Riesel base 4 k=19464. I'll take it to n=500K.

Updated presieved files ; progress for two k's
 

Hi,

I updated to-day the presieved files on my site :

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

Active Riesel files are sieved up to 2673.20 billions.

Active Sierpinski files are sieved up to 1069.88 billions.

Riesel even n's :

k = 9519 is up to n = 977632, no prime, continuing...

Riesel odd n's :

k = 148323 is up to n = 867999, no prime, continuing...

Regards,
Jean

Thank you for the Liskovets-Gallot's update!
 

Thank you very much for this update of the page dedicated to Liskovets-Gallot's conjectures on the RPS site, it will be very useful, and I was just going to post a request about it!
Best Regards,

Jean

Karsten,

Thanks for updating the Liskovets-Gallot conjectures page. I'm confused again now. You earlier in this thread reported that you had searched all of your reserved k's for the Riesel even-n and odd-n conjectures to n=385K so that is what my pages have shown for quite a while. But your Liskovets page shows the lower ranges of n=301K and 378K for your search limits.

Can you update us on where you are at on all of your Riesel even-n and odd-n k's and also update your pages to reflect your latest searched ranges if not already done so?


Thanks,
Gary

sorry for the confusion, forgot to update my current depths!

so here they are:

Riesel even: llring k=14361, 19401 and 20049 with Jeans (many thanks) sieve files.
currently at n=437 (base 2)

Riesel odd: llring k=30003, 103947, 106377, 147687, 154317 and 163503.
currently at n=409k (base 2)

[quote=kar_bon;135962]sorry for the confusion, forgot to update my current depths!

so here they are:

Riesel even: llring k=14361, 19401 and 20049 with Jeans (many thanks) sieve files.
currently at n=437 (base 2)

Riesel odd: llring k=30003, 103947, 106377, 147687, 154317 and 163503.
currently at n=409k (base 2)[/quote]

Great; thanks! I'll update my pages accordingly later today.

Now where are the primes at? :smile:


Gary

Riesel base 2 odd-n k=39687, 133977, and 155877 are now at n=755K; no primes.

Sierp base odd-n k=53133, 60357, 84363, and 85287 are now at n=689K; no primes.

Riesel base 4 k=19464 is at n=400K; no primes.

Sierp base 12 k=404 is at n=143K; no primes.

New status...
 

Hi,

Riesel even n's :

k = 9519 is up to n = 1031800, no prime, continuing...

Riesel odd n's :

k = 148323 is up to n = 915167, no prime, continuing...

Regards,
Jean

Updated presieved files
 

Hi,

I updated to-day the presieved files on my site :

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

Active Riesel files are sieved up to 3108.46 billions.

Active Sierpinski files are sieved up to 1330.86 billions.

Regards,
Jean

Status
 

Riesel base 2 odd-n k=39687, 133977, and 155877 are now complete to n=800K; no primes. I am now unreserving these.

Sierp base 2 odd-n k=53133, 60357, 84363, and 85287 are now at n=735K; no primes. Continuing on to n=800K.

Very stubborn k's!


Gary

Riesel base 4 k=19464 is at n=490K; no primes; continuing on to n=500K.

Sierp base 12 k=404 is at n=158K; no primes; continuing on to n=250K.


Gary

Riesel base 4 k=19464 complete to n=500K (n=1M base 2). No primes. This one promises to be a huge challenge to find a prime on. It is the only k-value remaining for this base that is a multiple of the base and it is extremely low-weight. k=19464/4=4866 had a prime at n=1 but unfortunately the prime for k=19464 at n=0 doesn't count.

I'm now releasing this k and adding a 2nd core to my new Riesel base 256 effort.


Gary

Sierp base 2 odd-n k=53133, 60357, 84363, and 85287 are at n=772K; no primes. Continuing to n=800K.

Sierp base 2 odd-n k=53133, 60357, 84363, and 85287 are complete to n=800K; no primes.

I'm now unreserving these stubborn k's.

New status ; Updated presieved files
 

Hi,

Riesel even n's :

k = 9519 is up to n = 1138936, no prime, continuing...

Riesel odd n's :

k = 148323 is up to n = 1023383, no prime, continuing...

These k's are stubborn, so, I will probably give up on them if no prime found at end of summer time...

I updated to-day the presieved files on my site :

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

Active Riesel files are sieved up to 4187.03 billions.

Active Sierpinski files are sieved up to 2007.69 billions.

Regards,
Jean

[quote=Jean Penné;138449]Hi,

Riesel even n's :

k = 9519 is up to n = 1138936, no prime, continuing...

Riesel odd n's :

k = 148323 is up to n = 1023383, no prime, continuing...

These k's are stubborn, so, I will probably give up on them if no prime found at end of summer time...

I updated to-day the presieved files on my site :

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

Active Riesel files are sieved up to 4187.03 billions.

Active Sierpinski files are sieved up to 2007.69 billions.

Regards,
Jean[/quote]


Thanks for the great sieving Jean! Very helpful! :smile:

If there is one thing that I have found with all bases that are powers of 2: The k's are tough to find primes for! Bases like 3, 6, 7, 9, and 31 are easy to find primes but not bases 2, 4, 8, 16, 32, etc. Many factors for the various n-values make for few candidates to search.


Gary

Status
 

even Riesel:
k=175567 to 763k, no prime
k=239107 to 1.103M, no prime

Liskovets, Riesel even n:
3 k's at 444k, no prime

Liskovets, Riesel odd n:
6 k's at 443k, no prime

continuing all.
will give the Liskovets-k's a boost on my Quad the next days!

New Status ; Updated presieved files
 

Hi,

Riesel even n's :

k = 9519 is up to n = 1255696, no prime, continuing...

Riesel odd n's :

k = 148323 is up to n = 1134543, no prime, continuing...

I updated to-day the presieved files on my site :

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

Active Riesel files are sieved up to 5644.99 billions.

Active Sierpinski files are sieved up to 2903.66 billions.

Regards,
Jean

New status ; Updated presieved files
 

Hi,

Riesel even n's :

k = 9519 is up to n = 1397376, no prime, continuing...

Riesel odd n's :

k = 148323 is up to n = 1166271, no prime, continuing...

I updated to-day (04/11/2008) the presieved files on my site :

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

Active Riesel files are sieved up to 7211.34 billions.

Active Sierpinski files are sieved up to 4020.12 billions.

Regards,
Jean

another k less to prove the conjecture:

Riesel odd n:
106377*2^475569-1 is prime

all (now 5) odd k's reserved by me at n=490k!

New Status and Reservations ; Updated sieved files
 

Congrats, Kasrsten, for the last prime found!
My sieving on the 13 remaining files crunches now 400,000 p's per second!!

Here is my new status :

Riesel even n's :

k = 9519 is up to n = 1450096, no prime. RELEASING THIS k !!

Riesel odd n's :

k = 148323 is up to n = 1203039, no prime ; RELEASING THIS k !!

In place of these two stubborn k's, I am now reserving for Riesel odd n's :

k = 35687 and k = 133977 which were released by Gary Barnes, and I will

LLR-test them from n = 800000 base 2.

I updated recently the presieved files on my site :

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

Active Riesel files are sieved up to 8000.92 billions.

Active Sierpinski files are sieved up to 4504.25 billions.

Regards,
Jean

[QUOTE=Jean Penné;151648]k = 35687 and k = 133977 which were released by Gary Barnes, and I will
[/QUOTE]

i've reserved k=39687 for you! :smile:

Sorry for the typo...
 

[QUOTE=kar_bon;151766]i've reserved k=39687 for you! :smile:[/QUOTE]

Thank you, Karsten, and sorry for the typo!

I am now LLR testing k = 39687 and k = 133977, both starting to 800,000 base 2

Regards,
Jean

just stopped the even-Riesel task to put the new sieved files in for testing and found this:

30003*2^613463-1 is prime!

hope the sieving gets another slight boost now!

i've put a 'Countdown' in the related Liskovets-Gallot-Conjectures-page:

only 20 primes and these 4 conjectures are proven! :smile:

Happy times : only 19 remaining now!
 

Congrats, Karsten, for your last discover!

I found that while going back at home :

133977*2^811485-1 is prime!

So, I wish to reserve k = 155877 in place, and will LLR test it starting to 800K

Best Regards,
Jean

[quote=Jean Penné;152102]Congrats, Karsten, for your last discover!

I found that while going back at home :

133977*2^811485-1 is prime!

So, I wish to reserve k = 155877 in place, and will LLR test it starting to 800K

Best Regards,
Jean[/quote]


Nice find! Darn, it looks like I stopped a little too early. :smile:

You've searched so much for n>1M that you deserved a quick prime for a change!


Gary

Karsten,

Can you give a status update on your even-n and odd-n conjecture searches?

As you know, our goal is n=600K base 2 on all powers-of-2 bases by year end. Riesel and Sierp base 16 just passed n=150K earlier this week and I just now passed n=75K on Sierp base 256 after completing Riesel base 256 to n=75K a couple of weeks ago.

The most important k at this point is k=20049 for even-n. It is also remaining for bases 4 and 16, the only k at n<600K base 2 that is remaining for 3 bases.

Also, all even-n would be more important than odd-n. Even-n k=14361 and 19401 are also remaining for base 4. None of the odd-n are remaining for base 4.

I think the next good goal to shoot for will be n=800K for all powers-of-2 bases by the end of March or April. We have sieved files available on almost all of them already either here or through the drives. The main exception would be Riesel base 256.


Thanks,
Gary

[QUOTE=gd_barnes;152868]Karsten,

Can you give a status update on your even-n and odd-n conjecture searches?
[/QUOTE]

sure, don't worry.

here the results:

even: k=14361, 19401, 20049 at n=964k (base 2), no primes :-(

odd: k= 103947, 147687, 154317, 163503 at n=665k (base 2)

i'll update the page today.

[quote=kar_bon;152878]sure, don't worry.

here the results:

even: k=14361, 19401, 20049 at n=964k (base 2), no primes :-(

odd: k= 103947, 147687, 154317, 163503 at n=665k (base 2)

i'll update the page today.[/quote]


Wow; a lot of work done! Thanks for the udpate.

These are very stubborn k!

New status ; Updated presieved files.
 

Hello,
Here is my new status :

Riesel odd n's :

k = 39687 is up to n = 1006557, no prime, continuing...

k = 155877 is up to n = 865805, no prime, continuing...

again two stubborn k's...

I updated yesterday the presieved files on my site :

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

Active Riesel files are sieved up to more than 9 T.

Active Sierpinski files are sieved up to more than 5 T.

Best wishes for year 2009 and best Regards,
Jean

Now only 18 remaining!!
 

Congrats to Karsten for the last Riesel base 2 odd n prime discovered :

147687*2^843689-1 253981 L550 Jan 2009

[url]http://primes.utm.edu/bios/code.php?code=L550[/url]

Now 18 primes are remaining to be found, to prove the four conjectures...
And the sieving of the 10 remaining Riesel base 2 files runs now at more than 472,000 p's per second!

Regards,
Jean

Releasing 2 k's, reserving 2 others ; sieved files
 

Hi,

Riesel odd n's :

k = 39687 is up to n = 1250277, no prime...

k = 155877 is up to n = 1000841, no prime...

I am now releasing these two stubborn k's, and wish to reserve two k's for Sierpinski odd n's, starting to 800K base 2 :

k = 53133 and k = 85287

The presieved files are now updated on my site :

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

The Riesel files are sieved up to 10.4 Tera
The Sierpinski files are sieved up to 5.68 Tera
Regards,
Jean

Sierpinski odd n's ; sieved files updated
 

Hi,

Sierpinski odd n's :

k = 53133 is up to n = 1128621, no prime...

k = 85287 is up to n = 1013507, no prime...

I am now releasing these two stubborn k's, and wish to reserve two other k's for Sierpinski odd n's, starting to 800K base 2 :

k = 60357 and k = 84363

The presieved files are now updated on my site :

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

The Riesel files are sieved up to 10.4 Tera
The Sierpinski files are sieved up to 6.69 Tera
Regards,
Jean
P.S. Please, Karsten, would you update the Liskovets-Gallot page in RPS accordingly (the reservation status is not up-to-date) ? Thank you by advance!

[QUOTE=Jean Penné;168586]P.S. Please, Karsten, would you update the Liskovets-Gallot page in RPS accordingly (the reservation status is not up-to-date) ? Thank you by advance![/QUOTE]

just done!

later today i'll give a status of my work on here.

[QUOTE=kar_bon;168634]just done!

later today i'll give a status of my work on here.[/QUOTE]

Thank you very much, Karsten!

A remark about Sierpinski odd n's :

I observe that k = 32247 is still showed at n = 1780000 base 2...
But it is really completed by the Conjecture R'us project to n = 2M :

please see [url]http://www.mersenneforum.org/showthread.php?t=9878[/url] post n°5

Best Regards,
Jean

[QUOTE=Jean Penné;168714]I observe that k = 32247 is still showed at n = 1780000 base 2...
But it is really completed by the Conjecture R'us project to n = 2M :
[/QUOTE]

thanks, corrected that.

my stats:

Riesel even (k=14361,19401,20049) at n=1126000 base 2

Riesel odd (k=103947,154317,163503) at n=968000 base 2

Sierpinski odd n's status ; Sieving
 

Hi,

Sierpinski odd n's :

k = 60357 is up to n = 1049415, no prime...

k = 84363 is up to n = 1055657, no prime...

I am now releasing these two stubborn k's, and wish to work again on k = 85287 starting to 1013507 base 2 and intending to go up to 1Mbits...

The presieved files are now updated on my site :

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

The Sierpinski files are sieved up to 8 Tera
Regards,
Jean

Riesel odd n's, working again on k = 155877
 

Hi,
I am now working again on k = 155877, intending to go up to 1Mbit n (base 2).
Regards,
Jean

Sierpinski and Riesel odd n's status
 

Hi,

Sierpinski odd n's :

k = 85287 is up to n = 1065947 base 2, no prime, releasing this k...

Riesel odd n's :

k = 155877 is up to n = 1049525 base 2, no prime, releasing this k...

Riesel even n's :

Working again on k = 9519 starting to n = 1450216 base 2
(the file is sieved up to 10 Tera...)
I hope to find a prime before reaching n = 2M base 2...
Regards,
Jean

Karsten,

Have you had any progress since April on your 6 reserved k's here?


Thanks.

[QUOTE=gd_barnes;186977]Have you had any progress since April on your 6 reserved k's here?
[/QUOTE]

not much effort done, because those 6 k's are running on a quite slow machine, but still working on them.

Gary, could you possibly add a link to Jean's page for sieved files for these and the base 4 conjectures at [URL]http://jpenne.free.fr/ConjRus/[/URL] to the respective Conjectures 'R Us web pages, like you do for directly posted sieve files? Something like "Sieved files available at ..." would do the trick. Right now it's somewhat of a hunt to find the web address to get the sieved files. :smile:

[quote=mdettweiler;188689]Gary, could you possibly add a link to Jean's page for sieved files for these and the base 4 conjectures at [URL]http://jpenne.free.fr/ConjRus/[/URL] to the respective Conjectures 'R Us web pages, like you do for directly posted sieve files? Something like "Sieved files available at ..." would do the trick. Right now it's somewhat of a hunt to find the web address to get the sieved files. :smile:[/quote]

Excellent idea. I'll do that with my next page updates.

even Riesel:

k=175567 at 815k
k=239107 at 1040k (don't know where the last value at n=1.103M i gave came from!)

[quote=kar_bon;189641]even Riesel:

k=175567 at 815k
k=239107 at 1040k (don't know where the last value at n=1.103M i gave came from!)[/quote]

That's k=351134 and 478214 for conjecture purposes, which is the way I have to show them on the pages and so the way I'd prefer they be stated here.

For k=478214, since there's been no (or negative!) progress since Sept. 9th, 2008, I'm leaving the status date unchanged.

Will you be working on these in the near future?


Gary

k=351134 at n=847k

will continue up to the testlimit of k=478214 and then test both together!

Presieved files updated and extended
 

Hi,
I extended the Riesel presieved files to n = 16M base two.
Now, both Sierpinski and Riesel active files have exponents up to 16M base two.
Please, see [url]http://jpenne.free.fr/ConjRus/[/url] for details...

For now, Riesel files are sieved up to 10.43 Tera,
and Sierpinski files are sieved up to 16.34 Tera.

(I am now using sr2sieve which is much faster than srsieve)

I hope to reach the 20 Tera in Dec. 2009 for Sierpinski and in Feb. 2010 for Riesel.

Riesel even n's :
My status for k = 9519 is to-day n = 1,568,160 no prime...

Regards,
Jean

Warning : Invalid links to Likovets-Gallot page...
 

Hi,

I observed that the links to Liskovets-Gallot page that are in the
[url]http://www.noprimeleftbehind.net/crus/[/url] site pages are no more valid.

The correct URL is : [url]http://www.rieselprime.de/Related/LiskovetsGallot.htm[/url]

More generally, The URL for the "Riesel Prime Database" site is : [url]http://www.rieselprime.de/[/url]

The old address : [url]http://www.rieselprime.org/[/url] is no more valid!

Regards,
Jean

[quote=Jean Penné;194347]Hi,

I observed that the links to Liskovets-Gallot page that are in the
[URL]http://www.noprimeleftbehind.net/crus/[/URL] site pages are no more valid.

The correct URL is : [URL]http://www.rieselprime.de/Related/LiskovetsGallot.htm[/URL]

More generally, The URL for the "Riesel Prime Database" site is : [URL]http://www.rieselprime.de/[/URL]

The old address : [URL]http://www.rieselprime.org/[/URL] is no more valid!

Regards,
Jean[/quote]


Oh! Thanks for pointing that out. I had corrected all of those at NPLB but forgot I had references to them in the CRUS pages. I'll correct them shortly.


Gary

Riesel odd n's

I'll going to start working on k=155877 starting at n=1049525 base 2

Sierp Odd n's
 

Sierpinski odd n's

I'll going to start working on k=85287 starting at n=1065947 base 2

Presieved files updated ; status for k = 9519
 

Hi,

Now, Riesel files are sieved up to 15.06 Tera,
and Sierpinski files are sieved up to 20.00 Tera.

(I am now using sr2sieve which is much faster than srsieve)

Note that, now, the two remaining k's for Sierpinski even n's (23451 and 60849) are deeply sieved, and so, may be LLR tested for n's above 2M!
Same remark, for Sierpinski odd n's, k = 32247 (64494) and k = 9267 (18534).

Riesel even n's :
My status for k = 9519 is to-day n = 1,623,616 no prime...

Regards,
Jean

Reserving Riesel base 2 odd-n k=39687 from n=1.25M-2M. I'll start this on my quad when Gary and I finish our collaborative S9 reservation up to 750K and estimate that it should take no more than two weeks or so after that.

[quote=mdettweiler;209440]Reserving Riesel base 2 odd-n k=39687 from n=1.25M-2M. I'll start this on my quad when Gary and I finish our collaborative S9 reservation up to 750K and estimate that it should take no more than two weeks or so after that.[/quote]

2 weeks on a quad to go n=1.25M-2M?? That sounds like a very fast quad or a very low-weight k, even if it is only the odd n's.

I'd be curious to see what your test time is on an n=~2M candidate.

[quote=gd_barnes;209442]2 weeks on a quad to go n=1.25M-2M?? That sounds like a very fast quad or a very low-weight k, even if it is only the odd n's.

I'd be curious to see what your test time is on an n=~2M candidate.[/quote]
According to Jean Penné's page it's the lowest-weight of the R2-odds. But, you're right, I'm beginning to wonder if that estimate is a tad off...I'll recheck that and try to get a better idea of how long it will take.

[quote=mdettweiler;209446]According to Jean Penné's page it's the lowest-weight of the R2-odds. But, you're right, I'm beginning to wonder if that estimate is a tad off...I'll recheck that and try to get a better idea of how long it will take.[/quote]
Yeah, you were right--it's going to take a LOT longer than that. It seems I probably won't get any farther than 1.4M or maybe 1.5M in two weeks. I could probably make it to 2M in a month or two at the latest, which still isn't too bad compared to the other bases I've been doing lately, so I'll still go ahead with it.

A couple of statuses (or stati or what ever the plural is for status):

Sierp Odd n - k= 85287 tested to n=1474035 base 2

Riesel Odd n - k= 155877 tested to n=1429120 base 2

Continuing both

BTW, I noticed that for these tests, which need to be sieved at the equivalent base 4 n-level for 2*k, are automatically converted to base 2 by LLR, but don't have their k halved as well. This is consistent with what we've seen in PFGW as well; when there's multiple things to be converted, they can do one but not the other.

Just to verify, such a number can be converted as follows, right?
k*4^n-1 = .5k*2^(n+1)-1
Since this will be run through a v2.4.6 PRPnet setup, which doesn't automatically convert power-of-2 bases, I'll need to preconvert the sieve file before loading it. (With the base preconverted LLR should be able to handle the k conversion on its own, though for consistency I'd kind of prefer to have the whole thing entirely converted ahead of time.)

[quote=mdettweiler;209453]BTW, I noticed that for these tests, which need to be sieved at the equivalent base 4 n-level for 2*k, are automatically converted to base 2 by LLR, but don't have their k halved as well. This is consistent with what we've seen in PFGW as well; when there's multiple things to be converted, they can do one but not the other.

Just to verify, such a number can be converted as follows, right?
k*4^n-1 = .5k*2^(n+1)-1
Since this will be run through a v2.4.6 PRPnet setup, which doesn't automatically convert power-of-2 bases, I'll need to preconvert the sieve file before loading it. (With the base preconverted LLR should be able to handle the k conversion on its own, though for consistency I'd kind of prefer to have the whole thing entirely converted ahead of time.)[/quote]


Math class time. Plug some actual small numbers in for k and n and see what you get. For example, try k=10 and n=6. Then fiddle with it until you know what you have is correct. I'd suggest using an Excel spreadsheet.

[quote=gd_barnes;209456]Math class time. Plug some actual small numbers in for k and n and see what you get. For example, try k=10 and n=6. Then fiddle with it until you know what you have is correct. I'd suggest using an Excel spreadsheet.[/quote]
Yeah, I did try plugging some actual numbers into LLR before seeing your post here; I discovered that it actually doesn't autoconvert k's regardless of whether it's converting a base. However, I was still able to confirm that k*2^n-1 = 2k*2^(n-1)-1 because the residues matched.

Therefore, it seems I wasn't quite correct in my earlier statement. The correct chain of equality should be:
k*2^n-1 = 2k*2^(n-1)-1 = 2k*4^.5(n-1)-1
Or reversed, i.e. what I'll need to plug into my Perl script (I'm not so good with Excel but I have a Perl script already set up for base 16 that should be able to be modified easily):
k*4^n-1 = k*2^2n-1 = .5k*2^(2n+1)-1
Testing on actual numbers confirms this--LLR produces matching residues both for the original base 4 and the converted base 2 input files.

[quote=mdettweiler;209459]Yeah, I did try plugging some actual numbers into LLR before seeing your post here; I discovered that it actually doesn't autoconvert k's regardless of whether it's converting a base. However, I was still able to confirm that k*2^n-1 = 2k*2^(n-1)-1 because the residues matched.

Therefore, it seems I wasn't quite correct in my earlier statement. The correct chain of equality should be:
k*2^n-1 = 2k*2^(n-1)-1 = 2k*4^.5(n-1)-1
Or reversed, i.e. what I'll need to plug into my Perl script (I'm not so good with Excel but I have a Perl script already set up for base 16 that should be able to be modified easily):
k*4^n-1 = k*2^2n-1 = .5k*2^(2n+1)-1
Testing on actual numbers confirms this--LLR produces matching residues both for the original base 4 and the converted base 2 input files.[/quote]

Yeah, going from base 4 to base 2 is much easier. From your original answer, you had only missed that the exponent should be 2n+1 instead of n+1.

IMHO, I think the sieve files should be the correct k and n to avoid such confusion. Another searcher or two has had to ask the same or a similar question. I know why Jean did it that way: So it would effectively automatically only search base 2 odd-n. In other words, it would have been an extra step to search all of base 2 for a bit and then remove the even n's. But once they were removed, it will sieve base 2 at the same speed as base 4.

Not sure why you had to compare residues in LLR. It takes no knowledge of Excel to do this. You pull it up and enter =10*4^6-1 into a cell. It will give you the answer. The same thing with OpenOffice in Linux. For that matter, you can use the calculator that Windows or Ubuntu provides.


Gary

[quote=gd_barnes;209461]Yeah, going from base 4 to base 2 is much easier. From your original answer, you had only missed that the exponent should be 2n+1 instead of n+1.

IMHO, I think the sieve files should be the correct k and n to avoid such confusion. Another searcher or two has had to ask the same or a similar question. I know why Jean did it that way: So it would effectively automatically only search base 2 odd-n. In other words, it would have been an extra step to search all of base 2 for a bit and then remove the even n's. But once they were removed, it will sieve base 2 at the same speed as base 4.[/quote]
Really? Wouldn't it take longer because sieving scales based on the n-range (and, for instance, 50K-200K is a rather bigger range than 25K-100K)?

[quote]Not sure why you had to compare residues in LLR. It takes no knowledge of Excel to do this. You pull it up and enter =10*4^6-1 into a cell. It will give you the answer. The same thing with OpenOffice in Linux. For that matter, you can use the calculator that Windows or Ubuntu provides.[/quote]
lol--duh, I hadn't thought of that. I was actually using much larger numbers (but still small in the grand scheme of things), in the vicinity of n=50K base 2.

[quote=mdettweiler;209464]Really? Wouldn't it take longer because sieving scales based on the n-range (and, for instance, 50K-200K is a rather bigger range than 25K-100K)?[/quote]

That's an apples to oranges comparison. The scaling is based on the aggregate size range of the numbers, not the n-value. It should sieve n=800K-1.6M base 2 at the same speed as n=100K-200K base 256. For the same reason, it should sieve the file that you're using at the same speed, regardless of whether it's base 2 or 4. After all, it will find the exact same factors either way.

[quote]
lol--duh, I hadn't thought of that. I was actually using much larger numbers (but still small in the grand scheme of things), in the vicinity of n=50K base 2.[/quote]

Didn't I suggest using small #'s like k=10 and n=6 in the "math class" to begin with?

[quote=gd_barnes;209469]That's an apples to oranges comparison. The scaling is based on the aggregate size range of the numbers, not the n-value. It should sieve n=800K-1.6M base 2 at the same speed as n=100K-200K base 256. For the same reason, it should sieve the file that you're using at the same speed, regardless of whether it's base 2 or 4. After all, it will find the exact same factors either way.[/quote]
Ah, okay, that makes sense. In that case, yeah, I suppose it probably would be better to just convert the master sieve files and do all further work from those.[quote]Didn't I suggest using small #'s like k=10 and n=6 in the "math class" to begin with?[/quote]
Yes, but as I mentioned earlier I came up with a similar idea before I'd seen your post, hence why I went ahead with my own numbers. :smile:

Status Liskovets-Gallot-values
 

Riesel even (k=14361,19401,20049) at n=1136k base 2

Riesel odd (k=103947,154317,163503) at n=979k base 2

I will bring the odd side to the level of the even and test all 6 k-values together then.


k=351134 and 478214 (or 175567 and 239107) at n=1040k base 2.

[quote=kar_bon;209840]Riesel even (k=14361,19401,20049) at n=1136k base 2

Riesel odd (k=103947,154317,163503) at n=979k base 2

I will bring the odd side to the level of the even and test all 6 k-values together then.


k=351134 and 478214 (or 175567 and 239107) at n=1040k base 2.[/quote]

Just to confirm: This equates to searching n=847K to 1040K for k=351134 and no work for k=478214 since your last status. Is that correct?

[QUOTE=gd_barnes;209901]Just to confirm: This equates to searching n=847K to 1040K for k=351134 and no work for k=478214 since your last status. Is that correct?[/QUOTE]

Yes, it's correct.

Riesel base 2 odd-n k=39687 is complete to n=2M; no primes. Results for 1.25M-2M are attached; releasing.

Riesel odd (k=103947,154317,163503) at n=1070k base 2 and continuing.

Riesel odd-n k=155877 tested to 1572628(base2) Releasing

Sierp odd-n k=85287 tested to 1644274(base2) Releasing