![]() |
Riesel base 60 is complete to n=10K. 3 primes found since n=8.5K. 81 k's remain. Details on the web pages. It is now unreserved.
Now reserving Sierp base 37 to n=25K. I'm currently at n=5K with 8 k's remaining. Gary |
1 Attachment(s)
[quote=gd_barnes;156038]Can you post a results file? Thanks.
Gary[/quote] attached |
Reserving Riesel Base 72
k=4 (last one) reserving from n=54K to n=200K |
Riesel Base 45
5128*45^31528-1 is prime! (1471.1138s+0.0036s) 17 left |
Riesel Base 37
Reserving all 27 k's from n=20K to n=70K Just thinning out the ranks |
1 Attachment(s)
Riesel base 75 tested to 10k. (No reservation.) No more testing.
17 ks remaining. |
1 Attachment(s)
Riesel base 95 tested to 10k. (No reservation.) No more testing.
24 ks remaining. I believe k=324 can be removed. Odd n has factors of 7,13,37 or 229 for as far as I could test. I think other ks can remain but I was having problems with the factoring website. The reason I am testing without making reservations is because it's difficult to tell which bases are hard until they are part tested. I regularly check this thread to make sure there is no repetition of work. :smile: I am trying to push Riesel base 39 to at least n=1000. |
Sierp base 33 complete to n=25K; 3 k's remaining
Sierp base 37 complete to n=25K; 4 k's remaining See k's and primes on the web pages. Both bases are now unreserved. |
[quote=Flatlander;156769]Riesel base 95 tested to 10k. (No reservation.) No more testing.
24 ks remaining. I believe k=324 can be removed. Odd n has factors of 7,13,37 or 229 for as far as I could test. I think other ks can remain but I was having problems with the factoring website. The reason I am testing without making reservations is because it's difficult to tell which bases are hard until they are part tested. I regularly check this thread to make sure there is no repetition of work. I am trying to push Riesel base 39 to at least n=1000.[/quote] Good analogy. That is correct that k=324 can be eliminated. The official covering set for odd-n is {7 13 229}. 37 is not needed. This is a most unusual situation. So far, there is only one other Riesel k and base < 100 where algebraic factors on even-n combine with a covering set of MORE than one factor on odd-n to eliminate a k. That is 1369*30^n-1. Gary |
[quote=Flatlander;156769]
I am trying to push Riesel base 39 to at least n=1000.[/quote] Also Riesel base 58. (Can't stand those gaps. lol) |
Reserving Sierp. base 33 for sieving to n=100K. :smile:
I was thinking that this would be an interesting base to run through PRPnet--we'd probably have it done in a very short time, and with only 3 k's remaining, there is a very good chance of proving this base in a short amount of time. What does everyone think about this? (Note: even if we don't do it through PRPnet, I still plan to complete the sieving, which I started earlier today and is proceeding to finish probably sometime today or tomorrow. :smile:) |
| All times are UTC. The time now is 21:50. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.