![]() |
Reserving Sierp 294 & 337 as new to n=25K
|
[quote=KEP;209694]Sierpinski base 272+278 is complete. Both is proven. Attached is a file with both bases. In the file is also all other k=8 sierpinski conjectures that I proved before trying to reserve them. Suite yourself, weather or not you will actually add them to the websites or not.
KEP Ps. This also means, that even though I started and took these sierpinski conjectures bases to n=2500: 230, 335, 398, 440, 482, 587, 608, 632, 650, 797 and 818, that they are suspended and verified for deletion from my harddrive, since no further work appeared to be wanted or allowed. So for now and forward on my DualCore is focusing on PG work only :smile:[/quote] Base S230 was already shown as completed to n=25K by me with only k=4 remaining. In addition to your S272 and S278, I went ahead and also showed S293. With Mark's recent work, this leaves R272 as the only k=8 conjectured base < 300 remaining untested. Sorry, if you want me to show the rest, you'll need to post them 2 at a time over a period of days like everyone else is doing. As tedius as it sounds, that's all that I'm asking to stem the tide somewhat. I like your bases 58 and 60 efforts. That's what we need a lot more of. :smile: Gary |
Riesel bases 356 and 377
Primes found:
2*356^4-1 3*356^2-1 4*356^1-1 5*356^432-1 7*356^5-1 2*377^4-1 4*377^3-1 6*377^6-1 The other k have trivial factors. With a conjectured k of 8, these conjectures are proven. |
Sierp Base 294
Sierp Base 294
Conjectured k = 119 Covering Set = 5, 59 Trivial Factors k == 292 mod 293(293) Found Primes: 114k's File attached Remaining k's: 3k's Tested to n=25K 61*294^n+1 99*294^n+1 116*294^n+1 k=1 is a GFN with no known prime Base Released |
Sierp Base 337
Sierp Base 337
Conjectured k = 534 Covering Set = 5, 13, 41 Trivial Factors k == 1 mod 2(2) and k = 2 mod 3(3) and k == 6 mod 7(7) Found Primes: 151k's File attached Remaining k's: Tested to n=25K 168*337^n+1 Trivial Factor Eliminations: 114k's Base Released |
[QUOTE=unconnected;209812]Riesel base 307, k=8
Primes: 4*307^1+1 6*307^549+1 Trivial factors k=2 Base proven.[/QUOTE] You will need to redo this. Change the type in the script to -1 to do Riesel forms. |
He deleted the incorrect work. Thanks for the catch Mark.
Unconnected, do you wish to reserve Riesel base 307? |
[quote=gd_barnes;209893]Unconnected, do you wish to reserve Riesel base 307?[/quote]
Yes, I'm already working on it. |
Riesel bases 440 and 482
Primes found:
2*440^2-1 3*440^1-1 4*440^1-1 5*440^2-1 6*440^2-1 7*440^1-1 2*482^2-1 3*482^3-1 4*482^135-1 5*482^2-1 6*482^6-1 7*482^1-1 With a conjectured k of 8, these conjectures are proven. Note how odd base 440 is. All primes were found with n=1 and n=2. |
Riesel base 307, k=8
Primes: 2*307^1-1 6*307^26262-1 Trivial factors k=4 Base proven. |
[QUOTE=unconnected;209909]Riesel base 307, k=8
Primes: 2*307^1-1 6*307^26262-1 Trivial factors k=4 Base proven.[/QUOTE] Nice! Many searchers would have stopped at n=25000. |
| All times are UTC. The time now is 22:25. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.