Sierp Base 463
 

Sierp Base 463
Conjectured k = 1188
Covering Set = 5, 13, 29
Trivial Factors k == 1 mod 2(2) and k == 2 mod 3(3) and k == 6 mod 7(7) and k == 10 mod 11(11)

Found Primes: 302k's - File attached

Remaining: 5k's - Tested to n=25K
30*463^n+1
178*463^n+1
436*463^n+1
616*463^n+1
1072*463^n+1

Trivial Factor Eliminations: 286k's

Base Released

Riesel base 475
 

Primes found:

[code]
2*475^2-1
6*475^42-1
8*475^19-1
12*475^2-1
14*475^3-1
18*475^65-1
20*475^2-1
24*475^1-1
26*475^2-1
30*475^1-1
32*475^1-1
36*475^1-1
38*475^1-1
42*475^1-1
44*475^1-1
48*475^2-1
[/code]

With a conjectured k of 50, this conjecture is proven.

Sierp Bases
 

The following Sierp Bases were submitted to me by Mark (Rogue) as proven. He sent me the found primes for all. They will be removed from the untested thread.

k*302^n+1 (conjectured k of 16)
k*321^n+1 (conjectured k of 22)
k*324^n+1 (conjectured k of 14)
k*339^n+1 (conjectured k of 16)
k*347^n+1 (conjectured k of 28)
k*371^n+1 (conjectured k of 32)
k*407^n+1 (conjectured k of 16)
k*413^n+1 (conjectured k of 22)
k*424^n+1 (conjectured k of 16)
k*439^n+1 (conjectured k of 34)
k*455^n+1 (conjectured k of 20)
k*459^n+1 (conjectured k of 24)
k*474^n+1 (conjectured k of 39)

[quote=MyDogBuster;214685]...by Mark (Roque)...[/quote]
It's "rogue" with a G, not "Roque" with a Q. :smile:

[QUOTE]It's "rogue" with a G, not "Roque" with a Q. :smile:[/QUOTE]

Oops my bad. :blush: Too early to be doing typing.

Sierp Base 338
 

Sierp Base 338
Conjectured k = 112
Covering Set = 3, 113
Trivial Factors k == 336 mod 337(337)

Found Primes: 97k's - File attached

Remaining k's: 13k's - File attached - Tested to n=25K

Base Released

k = 1 is a GFN with no known prime

Sierp 395
 

Testing out the new-bases script (having never attempted a base from scratch before.)
Reserving Sierp 395 with conjectured k=10 to n=25K.

R328 is done to n=150K. One prime. Base released.

Cleaning out my closets and creating work for myself.

R402 CK=92 Primes=87 Remain=1 2 algebraic factors
R480 CK=38 Primes=33 Remain=1 2 algebraic factors

Sierp 395
 

Conjectured k=10

Two primes
[CODE]6*395^1+1
2*395^2625+1[/CODE]

Remaining k=4,8. Tested to n=25k. Base released.

Residues and prime-log attached.

R386
 

R386 is proven, attached are the results.

Riesel 343
 

Riesel Base 343
Conjectured k = 1676
Covering Set = 5, 13, 43
Trivial Factors k == 1 mod 2(2) and k = 1 mod 3(3) and k == 1 mod 19(19)

Found Primes: 519k's - File attached

Remaining: 6k's - Tested to n=25K
314*343^n-1
516*343^n-1
1248*343^n-1
1334*343^n-1
1370*343^n-1
1422*343^n-1

k=8, 216 and 512 proven composite by full algebraic factors

Trivial Factor Eliminations: 308k's

MOB Eliminations:
686

Base Released

I thought it probably wise to post what I am working on currently to save duplication of work.
I am currently working on S273, S286, S290 and S298

Another base proven:
S369, CK=36 (covering set is {5, 37})
Primes:
[code]2*369^1+1
4*369^23+1
6*369^3418+1
8*369^1+1
10*369^1+1
12*369^3+1
14*369^1+1
16*369^4+1
18*369^27+1
20*369^2+1
24*369^53+1
26*369^4+1
28*369^1+1
30*369^1+1
32*369^11+1
34*369^1+1[/code]
The rest all have trivial factors.

I'm working on S341 (CK=20).

Sierp base 444, CK=179.
Primes attached.

Remaining k's:
46*444^n+1
88*444^n+1
111*444^n+1

Base completed to 25K and released.

Sierp base 286, CK=368 proven.
Primes attached.

Sierp 304
 

Sierp Base 304
Conjectured k = 121
Covering Set = 5, 61
Trivial Factors k == 2 mod 3(3) and k == 100 mod 101(101)

Found Primes: 76k's - File emailed

Remaining: 2k's - Tested to n=25K
60*304^n+1
69*304^n+1

Trivial Factor Eliminations: 41k's

Base Released

k=1 is a GFN with no known prime

HTML Created

Reserving S500 to 25K.

One deleted:
64*266^26843-1 is prime.

S298, CK=183, Two ks remaining.
Primes attached.
Base tested to 25k and released.

Reserving R273 and R287 as new to n=25K

[quote=Batalov;215479]One deleted:
64*266^26843-1 is prime.[/quote]

With the proof of R266, this is just the 2nd time that this has happened at CRUS and it is by far the largest base that it has occurred on:

4 consecutive bases in numeric progression have been proven! Riesel bases 263 thru 266 have no k's remaining. :smile:

The only other bases to do this are R11 thru R14.

A related 7 consecutive base area is interesting: R8 thru R14. 6 bases are proven (R8, R9, & the 4 bases above) and R10 only has 2 k's remaining. Good but not quite as good is S8 thru S14. 4 are proven, S8, S11, S13, & S14, and the remainder, S9, S10, & S12 all only have one k remaining at various search depths n>=460K.

Also, a related 6 consecutive base area is interesting: R181 thru R186. 3 consecutive are proven, R183 thru R185, and the remainder, R181, R182, and R186 all only have one k remaining at n=100K.

If anyone else spots any unusual base proof oddities, feel free to post them. To be considered interesting, they must be consecutive bases with at least half of them proven and none with more than 3 k's remaining.

[quote=gd_barnes;215583]With the proof of R266, this is just the 2nd time that this has happened at CRUS and it is by far the largest base that it has occurred on:

4 consecutive bases in numeric progression have been proven! Riesel bases 263 thru 266 have no k's remaining. :smile:

The only other bases to do this are R11 thru R14.[/quote]

Well...wouldn't you know it...not more than 2 hours after posting this, I finished up posting and uploading the final few of Mark's multitude of base proofs from a week or so ago and here comes another 4-peat:

Riesel bases 472 thru 475 are proven!

Even better: Riesel base 476 only has one k remaining at n=25K. Prove that one and we're looking at our first 5 in a row! It is far easier to prove than anything else that could make a 5-peat.

Based on that, I think I'll add 49*476^n-1 to the recommended thread. :smile:

Added 49*476^n-1 to the recommended bases list for n=25K-100K. The proof of R476 would give us 5 consecutive proven bases in numeric succession for the first time. R472 thru R475 are already proven.

Based on that, I druther ...reserve R471. :smile:

Reserving S428 to n=25K as the final base to complete the Sierp CK=10 and 12 bases.

Sierp base 500, CK=166.
Primes attached.

Remaining k's:
22*500^n+1
24*500^n+1
29*500^n+1
52*500^n+1
64*500^n+1
65*500^n+1
83*500^n+1
92*500^n+1
116*500^n+1
151*500^n+1
160*500^n+1
164*500^n+1

Base completed to 25K and released.

S341, CK=20: Complete to 25K and released.
1 k remaining: 10*341^n+1

Primes:
[code]2*341^1+1
6*341^2+1
8*341^1+1
12*341^1+1
18*341^5+1[/code]

The rest have trivial factors.

Sorry this took so long.

R471 didn't give up easily.
3 [I]k[/I] remain at n=25K: 144, 302, 408. (lists are attached)

Continuing to n=75K.

S428 with CK=10 is complete to n=25K; only k=8 remains; highest prime 4*428^14+1; base released.

Just in case R471 suddenly dies, I am running R470.
There are 2 [I]k[/I] remaining at n=12K: 83, 137. Will take it to 25K.

In order to gain some CPU efficiency, I'm going to reserve R383 to n=100K aswell. This means following:

I'll pause sieving of S383 at p=1300G and now I'll start sieving the 9 k's from R383 to p=1300G and then I'll merge the 2 sievefiles into 1 and sieve them combined :smile:

Take care!

Kenneth

R332 is complete to n=25K

Ck=38

k's remaining
k=18
k=28

k's removed from algebraic factors
k=36

Attached are the results.

[quote=KEP;215904]In order to gain some CPU efficiency, I'm going to reserve R383 to n=100K aswell. This means following:

I'll pause sieving of S383 at p=1300G and now I'll start sieving the 9 k's from R383 to p=1300G and then I'll merge the 2 sievefiles into 1 and sieve them combined :smile:

Take care!

Kenneth[/quote]

In this case, as a general rule, you will LOSE CPU efficiency by doing this but it is up to you. The reason why is that one side has so many more k's remaining than the other side: 50 k's vs. 9 k's. The guideline that I use is that if the ratio of # of k's remaining on one side is more than 3 times the # of k's remaining on the other side, then they should be sieved separately. I'll make an exception or two for very low # of k's remaining such as 4 vs. 1 or 7 vs. 2.

The reason why is that the optimum sieve depth on one side is likely to be so much different than the optimum sieve depth on the other side and/or the side with lesser k's will be held up quite a bit by the side with more k's.

Based on this, let me know if you wish to continue.

As a friendly reminder, for this likely 6 to 12 month effort, please be sure and back up your files at least once every 2-4 weeks. :smile:


Gary

@ Gary:

Based on your reply, I do not wish to continue, I really hadn't taken in to consideration that the difference in the amount of k's would have a somehow negative effect on the CPU efficiency. So as I write, I've cancelled further sieving, and thereby naturally also cancelled any R383 reservations.

Regarding the backup. I now every 4 weeks (the first weekend in the new month) do backup on an external HDD. So as you can see I also abandoned the backup on flash drives. So now in theory it should when all comes to all, still be possible to loose all work once again, but I seriously doubt it since data is now stored at least 2 places and as soon as S58 and S60 completes data will most likely be stored on the HDD of the Dual and the Quad core, plus on the external HDD. So one can say I learned my lesson at the last breakdown :smile:

Hope this got it all. I'm just wondering if the Primegrid people realize what you stated, since they have talked about merging the Riesel and Sierpinski sievefile, once the Riesel file is sieved just as deep as the Sierpinski file. Anyway that will be their headache and not ours, and maybe none of the 2 sievefiles will ever catch up on eachother, hence PG will avoid doing what started doing here :smile:

Take care

KEP

[quote=KEP;216058] I'm just wondering if the Primegrid people realize what you stated, since they have talked about merging the Riesel and Sierpinski sievefile, once the Riesel file is sieved just as deep as the Sierpinski file. Anyway that will be their headache and not ours, and maybe none of the 2 sievefiles will ever catch up on eachother, hence PG will avoid doing what started doing here :smile:

KEP[/quote]

The folks that run the PrimeGrid and SOB projects are quite sophisticated with many resources at their disposal. I'm fairly certain that they can merge the 2 files and have it make little differece because one side won't hold up the other, due to the fact that they can just sieve to virtually whatever depth that they want. It's remarkable how quickly that they can sieve. I read that they've already reached P=1P (1000T) for Riesel base 2.

The main reason that it becomes less efficient with fewer resources is that for far fewer k's, the optimum depth is frequently quite less. As an example, let's say that we were doing base 2. With our more limited resources, then one of the 2 sides would be held up for potentially a very long time getting all of the other side's k's sieved to a proper depth. It's not easy to tell which side would need to be sieved deeper for base 2 but I would guess it would be the Sierp side since it has been searched to n=~13M vs. n=~3M on the Riesel side, even though it's only 5 k's vs. 64 k's. But with almost unlimited resources, a project can afford to sieve to the deepest needed P-depth for all of the combined efforts that they are sieving at once.

Looked at in that manner and the fact that both sides are sieving all n<50M all of the time, it is technically more efficient to combine their sieves. The key is that they are not having one side "wait" on the other. The error that they could make is if they fail to start doing primality testing on the Riesel side while they are waiting to get it sieved to where the Sierp side is. At the much lower search depth of n=3M, even with more k's, the Riesel side should be able to start testing in the near future without having to wait to catch up to sieving on the Sierp side. That is where my two cents comes in to play here.

@ Gary's two cents :smile:

As far as I know, primality testing has begun for the Riesel side, and last I heard, PG according to Lennart were at p=1.7 P. On a side note, 2 k's have been pushed to n=5M, since they were the lowest weighed k's, weather or not they push the next low weight k to n=5M is not known to me, I'm just a bit puzzled as why they don't push a handfull at a time of the highweight k's to n=5M. That should statistically remove more k's and remove 3-5 % of all candidate n's. Anyway, I'm not participating at PG anymore, since I have no resources to spare. As always it was very educational reading and somewhat rather short reply this time :ermm:

Take care

Kenneth

Reserving S342 as new to n=25K

R318 is complete to n=25K
CK=144

3 k's remaining k=78,122,128

Attached are the results

Sierp 342
 

Sierp Base 342
Conjectured k = 552
Covering Set = 5, 7, 149
Trivial Factors k == 10 mod 11(11) and k == 30 mod 31(31)

Found Primes: 473k's - File emailed

Remaining: 10k's - File emailed - Tested to n=25K

Trivial Factor Eliminations: 66k's

GFN Eliminations: 1K
342 (has a prime at n=31)

Base Released

S290, CK=98, Four ks remaining.
Primes attached.
Base tested to 25k and released.

Sierpinksi Base 350
 

Conjectured k = 14. Reserving.

Completed the following to n=25K

R320 ck=106 primes=89 remain=3
R326 ck=110 primes=76 remain=2

Sierpinksi Base 350
 

Primes found:

[code]
2*350^1+1
3*350^1+1
4*350^2+1
5*350^20391+1
6*350^2+1
7*350^84+1
8*350^1+1
9*350^3+1
10*350^1294+1
11*350^1+1
12*350^1+1
13*350^6+1
[/code]

k=1 is a GFN. With a conjectured k of 14, this conjecture is proven (unless a GFN prime is required).

[QUOTE]k=1 is a GFN. With a conjectured k of 14, this conjecture is proven (unless a GFN prime is required). [/QUOTE]

We never require k=1 to be tested on any base. BTW 1*350^2+1 is prime.

Sierpinski bases 458 and 497
 

Reserving.

Here are the final 2 of 9 bases from my recent k=2 effort as shown in the bases 501-1024 thread. The following bases have been searched to n=25K and are released:

R380; CK=128; k=38, 50, 63, & 79 remain; highest prime 125*380^6358-1
S416; CK=140; k=73 & 118 remain; highest prime 31*416^23572+1

Collective primes for n=5K-25K:
125*380^6358-1
13*416^18232+1
31*416^23572+1

As points of interest:

The only base <= 500 that still has k=2 remaining at n=10K but is not shown on the pages is R303. But with a conjecture of 85368, that will be a toughie to search the entire base.

Here is a complete list of bases <= 500 that have k=2 remaining (and their search depths):
R170 (100K)
R303 (10K by me; not shown on pages)
S101 (100K)
S218 (100K)
S236 (25K)
S365 (25K)
S383 (25K)
S461 (75.7K)
S467 (25K)

The Sierp side has a lot of difficulty with k=2, 4, & 8 relative to the Riesel side.


Gary

Sierpinski Bases 483, 332, 480, and 429
 

Reserving

Sierpinski results
 

Base 458:

[code]
2*458^105+1
3*458^107+1
4*458^66+1
5*458^7+1
6*458^1+1
7*458^6+1
8*458^11+1
9*458^2+1
10*458^5952+1
11*458^1+1
12*458^13+1
14*458^79+1
15*458^1+1
[/code]

k=13 remains at n=25000. Releasing.

Base 497

[code]
2*497^1339+1
4*497^1898+1
6*497^169+1
10*497^4+1
12*497^4+1
14*497^1+1
[/code]

k=8 remains at n=25000. Releasing.

R341 is proven
CK=20

Largest prime

8*341^4966-1

Attached are the results

Reserving R272 (1 k) and R275 (2 k's) to n=100K.

Riesel bases 458 and 368
 

Reserving

Reserving Sierp 397 as new to n=25K

Removed 49*476^n-1 from the recommended bases list found prime by Max.

S475 with a CK of 288 is proven with a largest prime of 34*475^1387+1. Details on the pages.

This is the largest CK proof of any Sierp base > 300 to date! :smile:

I will now attempt to match on the Sierp side Max's 5 consecutive Riesel bases 472 to 476 proven. With S473/S474/S475 now proven and S475 having the highest CK in the group of 5, I will reserve S472 and S476 and also S470 for grins; all to n=25K.

R365 is proven

CK=62

Largest prime

46*365^18381-1

Attached are the results

Reserving R468, S468, and S492 to n=25K.

S472 is complete to n=25K; only k=21 & 67 are remaining; highest prime 55*472^2848+1; base released.

S476 is complete to n=25K; only k=28 is remaining; highest prime 7*476^42+1; base released. Another for the 1k thread.

This was a disappointing try at 5 consecutive proven Sierp bases. With only 3 k's remaining combined at n=3K on the final 2 of 5 bases; no primes were found for n=3K-25K. At least we got 3 consecutive, which is pretty decent on the Sierp side for such high bases.

Expectation would be to find about 1 prime from the final 3 k's remaining for n=25K-100K. With such little chance to prime all 3 and the bases so high, I'll leave that for someone else. Perhaps Max could prime the final k on base 476 like he did the Riesel side. :smile:

Results
 

Sierpinski base 332 primes found:

[code]

2*332^15+1
3*332^1+1
5*332^105+1
6*332^1+1
7*332^2+1
8*332^1+1
9*332^310+1
10*332^552+1
11*332^3+1
12*332^2+1
13*332^22+1
14*332^1+1
15*332^4+1
17*332^1327+1
18*332^6+1
19*332^14+1
20*332^31+1
21*332^4+1
22*332^10+1
23*332^269+1
24*332^3+1
25*332^2+1
26*332^61+1
27*332^4366+1
28*332^22+1
29*332^1+1
30*332^14+1
32*332^79+1
33*332^1+1
34*332^14+1
35*332^1+1
36*332^1+1
37*332^8+1
[/code]

k = 4, 16, 31 remain at n=25000. Released.

Riesel base 368 primes found:

[code]

2*368^8-1
3*368^1-1
4*368^1-1
5*368^2-1
6*368^1-1
7*368^7-1
8*368^2-1
9*368^23-1
10*368^83-1
11*368^10866-1
12*368^6-1
13*368^1-1
14*368^4-1
15*368^1-1
16*368^137-1
17*368^12-1
18*368^25-1
19*368^1-1
20*368^8-1
21*368^1-1
22*368^11-1
23*368^2204-1
24*368^1-1
25*368^1-1
26*368^6-1
27*368^2-1
28*368^1-1
29*368^8-1
30*368^9-1
31*368^3-1
32*368^15514-1
33*368^1-1
34*368^1-1
35*368^862-1
37*368^983-1
38*368^32-1
39*368^2404-1
[/code]

k=36 remains at n=25000. Released.

Sierpinski base 429 primes found:

[code]
2*429^1+1
4*429^175+1
6*429^2+1
8*429^1+1
10*429^45+1
12*429^54+1
14*429^1+1
16*429^2+1
18*429^1+1
20*429^1+1
22*429^1+1
24*429^3+1
26*429^2794+1
28*429^2+1
30*429^5+1
32*429^1+1
34*429^65+1
36*429^6+1
38*429^2+1
40*429^15+1
42*429^3+1
[/code]

Proven.

Riesel base 458 primes found:

[code]
2*458^2-1
3*458^1-1
4*458^1-1
5*458^6-1
6*458^11-1
7*458^9823-1
8*458^2-1
9*458^83-1
12*458^15-1
13*458^1-1
14*458^4-1
15*458^1-1
[/code]

k = 10 and 11 remain at n=25000. Released

More results
 

Sierspinski base 480 primes found:

[code]
2*480^8+1
3*480^3+1
4*480^2+1
5*480^29+1
6*480^5+1
7*480^1+1
8*480^2+1
9*480^2+1
10*480^1+1
11*480^1+1
13*480^50+1
14*480^18+1
15*480^2+1
16*480^1+1
17*480^1+1
18*480^1+1
19*480^2+1
20*480^1+1
21*480^6+1
22*480^7+1
23*480^7+1
24*480^4+1
25*480^5+1
26*480^2+1
27*480^14+1
28*480^1+1
29*480^1+1
30*480^1+1
31*480^4+1
32*480^1+1
33*480^2+1
34*480^2+1
35*480^3+1
36*480^3165+1
37*480^1+1
[/code]

k=12 remains at n=25000. Released.

Sierpinski base 483 primes found:

[code]

2*483^1+1
4*483^1+1
6*483^153+1
8*483^8680+1
10*483^1+1
12*483^2+1
14*483^1+1
16*483^4+1
18*483^14+1
20*483^1+1
22*483^1+1
24*483^1+1
26*483^8+1
28*483^2+1
30*483^3+1
[/code]

Proven.

R392 is complete to n=25K

CK=74

3 k's remaining k=7,28,56

No PRPs from n=2316 on (That is a first for me).

Attached are the results

Also reserving R338 to n=25K

Reserving S263.

Dmitry (unconnected) has R333 reserved to n=100K. After finding 2 top-5000 primes; he only has one k remaining at n=~90K. :smile:

S470 is complete to n=25K; 2 primes found for n=5K-25K; 4 k's remaining; highest prime 91*470^6500+1; base released.

R334
 

R334 sieve attached, no reservation.

25k-60k.
P=1.1T (1166975616589:M:1:334:258), over-sieved.

S266 sieved.
 

S266 sieve attached, no reservation.

25k-50k.
P=0.74T (740091963437:P:1:266:257), over-sieved.

(These are usually run over night, so progress is not checked until morning. Trying to keep my laptop busy on quick 64-bit work. Headers are posted here to keep a record of sieve depth; the header normally being changed for PFGW.)

[quote=Flatlander;219083]S266 sieve attached, no reservation.

25k-50k.
P=0.74T (740091963437:P:1:266:257), over-sieved.

(These are usually run over night, so progress is not checked until morning. Trying to keep my laptop busy on quick 64-bit work. Headers are posted here to keep a record of sieve depth; the header normally being changed for PFGW.)[/quote]
What I usually do in such situations is use a PFGW comment, like this:

ABC $a*266^$b+1 // {number_primes,$a,1} //740091963437:P:1:266:257

That way, I can switch it into ABC format quite easily without losing the sieve depth data. Note from the above example that you can have multiple comments on the same line: I have verified that lines like that work in PFGW. (And with PRPnet, though I usually don't bother with the "number_primes" thing for that since it ignores it anyway.)

Ah thanks, I wasn't sure if that would work okay. :smile:

S335 sieved.
 

S335 sieve attached, no reservation.

25k-60k.
P=0.6T. (Al dente.)

R338 is complete to n=25K

CK=74

6 k's remain k=5,7,22,44,56,71

attached are the results

R347 sieved.
 

R347 sieve attached, no reservation.

25k-100k.
P=1.1T.

S341 sieved.
 

S341 sieve attached, no reservation.

25k-60k.
P=0.8T.

S263 tested to 100k.
Released.

Sieving for S259 should finish in a day or two.

Riesel base 500 completed to n=100K.
Only 1 prime this time: 107*500^30954-1

Results attached.

S259 and S401 sieved.
 

S259 and S401 sieves attached, no reservations.

S259
50k-150k.
P=3.6T.

S401
25k-100k
P=1.8T

R272 complete to n=100K, no prime.

Results attached, base released.

Riesel 287
 

Riesel Base 287
Conjectured k = 14276
Covering Set = 3, 5, 17, 457
Trivial Factors k == 1 mod 2(2) and k == 1 mod 11(11) and k == 1 mod 13(13)

Found Primes: 5751k's - File emailed

Remaining: 222k's - File emailed - Tested to n=25K

Trivial Factor Eliminations: 1148k's

MOB Eliminations: 16k's - File emailed

Base Released

R468 is complete to n=25K; 1 prime found for n=5K-25K; 5 k's remaining; base released.

S468 is complete to n=25K; 5 primes found for n=5K-25K; 6 k's remaining; base released.

S492 is complete to n=25K; 2 primes found for n=5K-25K; 3 k's remaining; base released.

S273 is finally finished to 25k with 15 ks remaining.
Primes and results linked.
[url]http://www.sendspace.com/file/zgj8k8[/url]

I had R470 (as well as R471) continued to n=75K, but didn't make a note of it.
With 83*470^61902-1 prime, there's one [I]k[/I]=137 left.
Re-reserving to n=100K.

Here is a clarification that I got from Serge in a PM on his status for R470 and R471:

[quote]
Briefly, R471 is of course slow (with 3k's!) and I only intend to finish the 75K that I reserved. Tests are taking 1100s for R471 now. It is at 67K; no primes.
R470 also takes 800-900s per test but with the sudden prime I will take it to 100K.
[/quote]

S363 with CK=64 is proven with a highest prime of 48*363^4283+1.

Also reserving S320 with CK=106 to n=25K.

Whilst work on R603 is paused (see question in relevant thread), I'll take S425 (conj k=70) out for a spin.
Two k remain at n=2500, (k=8 and k=70) (actually, do I need to test k=70? I'm having a daft moment here :P)
Reserved to n=25K.

paleseptember,

You do not need to test k=70, since it is the CK.

Thank you for your time

Mathew

Thanks Mathew!

(In my defence, it's been a long day.)

S320 is complete to n=25K; no primes for n=5K-25K; 3 k's remaining; largest prime 49*320^2580+1; base released.

Reserving S334 to n=25K.

Reserving S410 to n=25K.

I made an error in my post [URL="http://www.mersenneforum.org/showpost.php?p=220024&postcount=470"]above[/URL]. I was testing Riesel 425, not Sierpinski 425.

Riesel 425 is complete to n=25K. Only k=8 remains (conj. k=70). Results emailed to Gary.

[quote=paleseptember;220128]I made an error in my post [URL="http://www.mersenneforum.org/showpost.php?p=220024&postcount=470"]above[/URL]. I was testing Riesel 425, not Sierpinski 425.

Riesel 425 is complete to n=25K. Only k=8 remains (conj. k=70). Results emailed to Gary.[/quote]

Unfortunately, you were actually testing Sierp base 425. Here is what happened:

1. You reserved and tested [B]Sierp[/B] 425 for n<=2500. As you stated, only k=8 remained.
2. You tested [B]Riesel[/B] 425 k=8 for n>2500.

There is a silver lining in this. I see what happened. In looking at the results file, I'm fairly certain that your sieve file is correct except for one small thing: You changed the header to -1 instead of +1. In other words, you tested the n-values that were intended for 8*425^n+1 for 8*425^n-1 instead after you had correctly sieved it. I am fairly certain of this because you are testing n-values such as n=11 and n=53. Had you sieved 8*425^n-1, those n-values would have been quickly sieved out with a factor of 3. So your sieve file should be correct for 8*425^n+1 if you make that small change. Then you'll be able to quickly rerun it and get good tests.

On the Riesel side, k=8 is eliminated quickly because 8*425^2-1 (and 8*425^10-1) are prime.

Both sides have the same conjecture of k=70; a fairly common occurrence, which can make it easy to confuse the 2 sides.

I just now did a quick run for R425 to n=2500. k=46, 50, and 64 remain.

Usually I'd like bases to be at n>=10K before showing on the pages but based on the situation, I'll go ahead and show both sides of base 425 at n=2500 with their applicable k's remaining. (Note Ian: S425 won't get shown in the 1k thread until it's searched to n=25K.)

You can choose to do one of 4 things:

1. Test S425 k=8 for n=2500-25K.
2. Test R425 k=46, 50, and 64 for n=2500-25K.
3. Do them both.
4. Do nothing at all. :smile:

Let me know what you decide. I'll show all of the applicable info. on the pages for both sides. Whatever you choose to do, I'll reserve or keep it reserved for you. Whatever remains after you are done, with the CK=70 on both sides, they will likely get tested fairly soon by someone.


Gary

I think [URL="http://www.mersenneforum.org/showpost.php?p=220026&postcount=472"]that it had been a long day[/URL], and my general daftness mean that it's just a big headdesk of fail on my account.

Gaaahhh!

Okay. I shall tackle option 3. That is, test S425 and R425 from 2500 to 25K. I shall attempt to not mistake + for - this time.

Rerserving these single k conjectures:
64*259^n+1
55*266^n+1
4*335^n+1
10*341^n+1
20*401^n+1
14*334^n-1
22*347^n-1

Another k bites the dust
 

55*266^32246+1 is prime!

Conjecture proven.

S334 is complete to n=25K; no primes for n=5K-25K; 3 k's remaining; largest prime 49*334^951+1; base released.

S425 and R425
 

For Sierpinski 425, k=8 remains, tested to n=25,000.

For Riesel 425, k=64 remains, tested to n=25,000. Along the way primes for k=46 and k=50 were found. Results to Gary, etc...

Bases released

S426
 

(Yes, I checked that it was Sierpinksi :P)

Sierpinksi 426, conjectured k=62.
Tested to n=5K, only k=8 remains.
Will continue to n=25K.

S426
 

Sierpinski base 426.
Only k=8 remains at n=25e3.
Base released.