![]() |
S671 and S692 k=8 conjectures proven and added to the pages.
|
[QUOTE=gd_barnes;210706]Mark,
k=28257 already had a prime at n=9968. So this makes 94 k's with primes and 740 k's remaining at n=15K. Is that stop-on-prime option working correctly? :-) Also, you might want to check your sorting. I resorted it but you had it sorted in a left to right alphanumeric sort, which caused k's like k=1234, 12345, etc. to sort before k's like k=134, 145, etc. [/QUOTE] :smile: I have been using PRPNet. I loaded a new server with a sieve file, but since I had started sieving weeks before I started testing the range I must not have removed that k before putting the sieve file into the new server. I don't recall if I had any particular sorting criteria when I selected the primes. I'll remember to sort by k next time, actually sort by cast(k as unsigned) next time. |
Riesel base 679
1 Attachment(s)
Tested to 100000 and released. No primes found. I have attached residues.
|
Riesel bases 791 and 890
Primes found:
2*791^4-1 4*791^1-1 8*791^4-1 2*890^428-1 3*890^138-1 4*890^1-1 5*890^2-1 6*890^2-1 7*890^1-1 9*890^1-1 The other k have trivial factors. With a conjectured k of 10, both of these conjectures are proven. |
Riesel Base 889
Riesel Base 889
Conjectured k = 266 Covering Set = 5, 89 Trivial Factors k == 1 mod 2(2) k == 1 mod 3(3) and k == 1 mod 37(37) Found Primes: 80k's - File attached Remaining k's: 4k's - Tested to n=25K 14*889^n-1 86*889^n-1 194*889^n-1 216*889^n-1 k=144 proven composite by partial algebraic factors Trivial Factor Eliminations: 47k's Base Released |
Riesel Base 894
Riesel Base 894
Conjectured k = 284 Covering Set = 5, 7, 31, 283 Trivial Factors k == 1 mod 19(19) and k == 1 mod 47(47) Found Primes: 246k's - File attached Remaining k's: 10k's - Tested to n=25K 6*894^n-1 59*894^n-1 79*894^n-1 151*894^n-1 179*894^n-1 184*894^n-1 216*894^n-1 220*894^n-1 225*894^n-1 276*894^n-1 k=4, 9, 49, 64, 144, 169 proven composite by partial algebraic factors Trivial Factor Eliminations: 20k's Base Released |
[quote=rogue;210724]:smile: I have been using PRPNet. I loaded a new server with a sieve file, but since I had started sieving weeks before I started testing the range I must not have removed that k before putting the sieve file into the new server.
I don't recall if I had any particular sorting criteria when I selected the primes. I'll remember to sort by k next time, actually sort by cast(k as unsigned) next time.[/quote] Technically I don't need them sorted, although it looks a little neater if it is. :smile: I have a quick routine that I use to sort them descending by n-value to show on the pages, which can be quickly tweaked to sort ascending by k-value. One way that it does help is to make it a little easier when referring back to them for historical reference. More than anything, I just wanted you to make sure you checked any automated selection criteria or sorting routine. It sounds like nothing was amiss there. Gary |
Riesel base 827, k=14
Primes: 2*827^2-1 4*827^1-1 6*827^9-1 10*827^1-1 12*827^1-1 Trivially factors: k=8 Base proven. |
S632 and S818 k=8 conjectures proven and added to the pages.
These two took some larger primes to prove them: 7*632^8446+1 4*818^7726+1 |
Riesel bases 608 and 956
Primes found:
2*608^2-1 3*608^1-1 4*608^83-1 5*608^26-1 6*608^6-1 With a conjectured k of 8, k=7 remains and has been tested to n=25000. Primes found: 2*956^18-1 3*956^143-1 4*956^1-1 5*956^192-1 7*956^1-1 8*956^4-1 9*956^309-1 With a conjectured k of 10, this conjecture is proven. |
1 Attachment(s)
[quote=henryzz;210519]reserving riesel 752
there are 13 ks remaining at n=2500 which i think is high for a conjecture of ~100[/quote] primes since 2.5k: 53*752^3958-1 66*752^4282-1 29*752^9580-1 68*752^12000-1 remaining: 8*752^n-1 11*752^n-1 22*752^n-1 58*752^n-1 59*752^n-1 64*752^n-1 65*752^n-1 95*752^n-1 97*752^n-1 all remaining ks tested to 30k and unreserved |
| All times are UTC. The time now is 22:49. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.