Bases 501-1030 reservations/statuses/primes

[paleseptember]

Sierpinski 928 is at n=11K

22 primes so far:

372*928^10905+1
1903*928^10946+1
2236*928^10935+1
7059*928^10927+1
7318*928^10831+1
8014*928^10330+1
9385*928^10578+1
10365*928^10782+1
10434*928^10765+1
10521*928^10556+1
11229*928^10505+1
15007*928^10676+1
17386*928^10200+1
17778*928^10478+1
18664*928^10282+1
19036*928^10875+1
19267*928^10584+1
19656*928^10412+1
19785*928^10381+1
21007*928^10922+1
24796*928^10451+1
26176*928^10392+1

There are 664 k remaining. Continuing.
Files emailed to Gary.

[MyDogBuster]

Reserving Riesel 727 as new to n=25k

[mdettweiler]

R986: proven, CK=8
Trivial k's: 1, 6
No MOB's, GFNs
Primes:
2*986^22-1
3*986^1-1
4*986^1-1
5*986^5580-1
7*986^12505-1

[unconnected]

Sierp base 900, CK=12.
Primes:
2*900^1+1
3*900^3+1
4*900^3+1
5*900^3+1
6*900^47+1
7*900^1+1
9*900^1+1
10*900^1+1
11*900^1+1
8*900^2270+1

Base proven.

[MyDogBuster]

Riesel Base 727
Conjectured k = 246
Covering Set = 7, 13
Trivial Factors k == 1 mod 2(2) and k == 1 mod 3(3) and k == 1 mod 11(11)

Found Primes: 70k's - File attached

Remaining k's: 4k's - Tested to n=25K
8*727^n-1
48*727^n-1
156*727^n-1
194*727^n-1

Trivial Factor Eliminations: 48k's

Base Released

[vmod]

Reserving

S869 to n=75K

[paleseptember]

Continuing with the experimentation of the new-bases script, I'm going to have a go with Riesel 603. According to the untested bases thread, it has a conjectured k=11324. (I'm crazy with these large k-values, no?) ;]

Arghh, I'm getting _lots_ of these errors:

Error occuring in PFGW at Wed May 12 19:58:24 2010
Expr = 8594*603^361-1
Detected in MAXERR>0.45 (round off check) in prp_using_gwnum
Iteration: 94/3347 ERROR: ROUND OFF 0.46094>0.45
PFGW will automatically rerun the test with -a1
-----------------------------------------------------------------------

They kicked in at ... 4090*603^2467-1 and continued all the way to 11318*603^520-1

I have updated my version of pfgw (I was using whatever was in the CRUS package, which is now woefully out of date), and re-running the script. Is this the sort of error, Gary, that were running into recently?

Advice, comments, platitudes? Iced biscuits?

[rogue]

Originally Posted by paleseptember

Continuing with the experimentation of the new-bases script, I'm going to have a go with Riesel 603. According to the untested bases thread, it has a conjectured k=11324. (I'm crazy with these large k-values, no?) ;]

Arghh, I'm getting _lots_ of these errors:

Error occuring in PFGW at Wed May 12 19:58:24 2010
Expr = 8594*603^361-1
Detected in MAXERR>0.45 (round off check) in prp_using_gwnum
Iteration: 94/3347 ERROR: ROUND OFF 0.46094>0.45
PFGW will automatically rerun the test with -a1
-----------------------------------------------------------------------

They kicked in at ... 4090*603^2467-1 and continued all the way to 11318*603^520-1

I have updated my version of pfgw (I was using whatever was in the CRUS package, which is now woefully out of date), and re-running the script. Is this the sort of error, Gary, that were running into recently?

Advice, comments, platitudes? Iced biscuits?

This is due to the version of PFGW you were using. Most (if not all) of these should go away with 3.3.3/3.3.4. With the version you are using, there is no immediate problem since PFGW detected the error and corrected itself.

[paleseptember]

Am getting the errors again (running with PFGW 3.3.4 now) for the same k/n pairs.

Since it's re-running with the -a1 switch (again), I'm going to assume that pfgw is taking care of it, but just in case, I've attached the pfgw_err.log for brighter minds if they're interested.

[unconnected]

Sierp base 800, CK=88.
Primes attached.

k's remain:
26*800^n+1
61*800^n+1
82*800^n+1

Base completed to 25K and released.

[rogue]

Originally Posted by paleseptember

Am getting the errors again (running with PFGW 3.3.4 now) for the same k/n pairs.

Since it's re-running with the -a1 switch (again), I'm going to assume that pfgw is taking care of it, but just in case, I've attached the pfgw_err.log for brighter minds if they're interested.

I'll see what we can do, but I'm not too concerned about it.