[quote=mdettweiler;185596]Yes, I'm done with that base. Regarding the remaining k's, I don't have a .txt file on hand, but here's what I usually do for such things:

-Copy and paste the list of k's into a text editor
-Use search/replace to replace ", " (that's a comma and a space) with "*39^n-1\n" (the \n is interpreted as a newline in most text editors).
-Save the file.
-The file can now be used with srsieve as an equations file to start off a sieve with.[/quote]

Excellent, that helps me out too.

Sierp base 52 is complete to n=25K; 44 k's remaining; now unreserved.

Sierp base 67 is complete to n=25K; 63 k's remaining; now unreserved.

Sierp bases 45 and 91 are now sieving for n=5K-25K.

Riesel Base 39
 

Riesel Base 39

Tested to n=2K. 4092 primes found (see attached file)

10797 k's remaining + the 1 I am not testing = 10798 left

Continuing

[quote=MyDogBuster;186642]Riesel Base 39

Tested to n=2K. 4092 primes found (see attached file)

10797 k's remaining + the 1 I am not testing = 10798 left

Continuing[/quote]

Max or Ian,

Can you by chance take Ian's primes here and write a script to remove those k's from my base 39 reservations page? Just verify that there are 10797 remaining (plus the 1 not being tested). All that I'd need is a comma-delimited text file of them.

If you can provide me with the script and/or software that runs the script (if necessary), that'd really help me. I'd like to get into writing some automated scripts for such things to save some time.


Thanks,
Gary

[quote]All that I'd need is a comma-delimited text file of them.
[/quote]Comma delimited like 1,2,3,4,5,6,7 OR
1,
2,
3,
4,

Either way is hard to do. I do have a file like choice#2 but the k's are in computer collated sequence instead of lowest to highest.

1000094,
1000376,
100134,
1001554,
1002414,
1002494,
100262,
1002734,
1002884,
1002976,
100304,
1003104,
100314,
1003534,
1003576, etc etc etc

[QUOTE=gd_barnes;186653]Max or Ian,

Can you by chance take Ian's primes here and write a script to remove those k's from my base 39 reservations page? Just verify that there are 10797 remaining (plus the 1 not being tested). All that I'd need is a comma-delimited text file of them.

If you can provide me with the script and/or software that runs the script (if necessary), that'd really help me. I'd like to get into writing some automated scripts for such things to save some time.


Thanks,
Gary[/QUOTE]

Well actually it can "easily" be done without a script. Here is what I do, when I start out with any k's remaining, and then has to find out which of the k's is not primed at nmax:

1. Convert the k's remaining at low-n list to k*b^1-/+1
2. Copy that list and insert it in the end of the pfgw-prime.log file
3. Add the "For most 1 prime" command in the first line of the pfgw-prime.log file
4. Run a PRP test of all the primes and k's remaining using pfgw.exe with the -l command
5. Go to the log file and copy alle the k*b^1-/+1 k's into your k-list
6. Search and replace *b^n-/+1

And you should be good to go, and have a clean list of k's remaining. That way you avoid man made mistakes and never fails to remove k's that shouldn't be removed and never have k's remaining that should have been removed, unless your computer is faulty. Hope this helps.

Regards

Kenneth

Ps. This should deffinently be used for removing k's from the b=3, 7 and 15 and some of the other monsters since it saves a bundle of time :smile:

Riesel base 100 is complete to n=100K, results for 60K-100K attached. Releasing.

[quote=KEP;186668]Well actually it can "easily" be done without a script. Here is what I do, when I start out with any k's remaining, and then has to find out which of the k's is not primed at nmax:

1. Convert the k's remaining at low-n list to k*b^1-/+1
2. Copy that list and insert it in the end of the pfgw-prime.log file
3. Add the "For most 1 prime" command in the first line of the pfgw-prime.log file
4. Run a PRP test of all the primes and k's remaining using pfgw.exe with the -l command
5. Go to the log file and copy alle the k*b^1-/+1 k's into your k-list
6. Search and replace *b^n-/+1

And you should be good to go, and have a clean list of k's remaining. That way you avoid man made mistakes and never fails to remove k's that shouldn't be removed and never have k's remaining that should have been removed, unless your computer is faulty. Hope this helps.

Regards

Kenneth

Ps. This should deffinently be used for removing k's from the b=3, 7 and 15 and some of the other monsters since it saves a bundle of time :smile:[/quote]


Brilliant and with no script! Thanks for the excellent idea! :smile: I shall use it going forward for removing large #'s of k's from lists.

[QUOTE=gd_barnes;186980]Brilliant and with no script! Thanks for the excellent idea! :smile: I shall use it going forward for removing large #'s of k's from lists.[/QUOTE]

You're very welcome my friend. This just sounded to me a bit more easy than making a new script. Glad that you could use it :smile:

Riesel Base 53
 

Riesel Base 53

Reserving all k's - Testing from n=10k-25k

Sierp. base 43 is complete to n=100K, no primes. Results are attached for 25K-100K. Releasing this base.

Reserving Sierp. base 37 for 25K-100K.