![]() |
|
|
#188 |
|
May 2007
Kansas; USA
242558 Posts |
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 |
|
|
|
|
|
#189 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
588610 Posts |
|
|
|
|
|
|
#190 |
|
May 2008
Wilmington, DE
22·23·31 Posts |
Reserving Riesel Base 72
k=4 (last one) reserving from n=54K to n=200K Last fiddled with by MyDogBuster on 2008-12-31 at 20:24 |
|
|
|
|
|
#191 |
|
May 2008
Wilmington, DE
B2416 Posts |
Riesel Base 45
5128*45^31528-1 is prime! (1471.1138s+0.0036s) 17 left |
|
|
|
|
|
#192 |
|
May 2008
Wilmington, DE
54448 Posts |
Riesel Base 37
Reserving all 27 k's from n=20K to n=70K Just thinning out the ranks |
|
|
|
|
|
#193 |
|
I quite division it
"Chris"
Feb 2005
England
81D16 Posts |
Riesel base 75 tested to 10k. (No reservation.) No more testing.
17 ks remaining. |
|
|
|
|
|
#194 |
|
I quite division it
"Chris"
Feb 2005
England
31·67 Posts |
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. |
|
|
|
|
|
#195 |
|
May 2007
Kansas; USA
32×13×89 Posts |
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. Last fiddled with by gd_barnes on 2009-01-08 at 04:20 |
|
|
|
|
|
#196 | |
|
May 2007
Kansas; USA
28AD16 Posts |
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 |
|
|
|
|
|
|
#197 |
|
I quite division it
"Chris"
Feb 2005
England
207710 Posts |
|
|
|
|
|
|
#198 |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
624910 Posts |
Reserving Sierp. base 33 for sieving to n=100K.
![]() 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. )
Last fiddled with by mdettweiler on 2009-01-08 at 19:48 |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Riesel base 3 reservations/statuses/primes | KEP | Conjectures 'R Us | 1108 | 2021-08-04 18:49 |
| Bases 251-500 reservations/statuses/primes | gd_barnes | Conjectures 'R Us | 2305 | 2021-08-04 15:09 |
| Bases 501-1030 reservations/statuses/primes | KEP | Conjectures 'R Us | 3920 | 2021-08-04 14:39 |
| Bases 101-250 reservations/statuses/primes | gd_barnes | Conjectures 'R Us | 908 | 2021-08-01 07:48 |
| Bases 6-32 reservations/statuses/primes | gd_barnes | Conjectures 'R Us | 1397 | 2021-07-25 07:07 |