[QUOTE=lalera;441746]
For sequences k*b^n+/-1 and prime factor p, the following limits apply:

1 < k < 2^32.
1 < b < 2^32.
core(k)*core(b) < 2^31. (core(k) is the squarefree part of k).
0 < n < 2^32.
k,b < p < 2^52. (or 2^62 for x86/x86-64 builds, or 2^63 for ppc64).
(taken from the readme)
k=up to 4e9[/QUOTE]
Try k's above 2^31 and below 4e9, and let me know which of these rules stop you from using sr2sieve once you find it doesn't work. A very small number of k's between 2^31 and 2^32 work, but nobody has shown interest in filtering a list of k's to find out just which.

I have plenty of R3 work to keep me busy for quite a long time- but if you get interested in '17 in R7 or R15, I'll be happy to help.

[QUOTE=VBCurtis;441788]Try k's above 2^31 and below 4e9, and let me know which of these rules stop you from using sr2sieve once you find it doesn't work. A very small number of k's between 2^31 and 2^32 work, but nobody has shown interest in filtering a list of k's to find out just which.

I have plenty of R3 work to keep me busy for quite a long time- but if you get interested in '17 in R7 or R15, I'll be happy to help.[/QUOTE]

hi,
i tried out a little k´s over 2e9
with srsieve and sr1sieve it works
with sr2sieve it works not
i can not filter out some k´s over 2e9 that will work with sr2sieve
thank you for your tips

Right- it's the "square-free part of k < 2^31" that matters. k's between 2^31 and 2^32 with perfect-square factors *will* work with sr2sieve, but I imagine those are so rare it's not worth filtering for them and tracking a handful of k's separately from the rest of 2e9-4e9.

So, when we go after R7 or R15, we'll expand to 2e9!

Yes please make it k<=2e9 for sieving/testing R7/R15 in the future. That makes admin much easier. :smile:

hi,
to gd_barnes:
please, can i have a list of the remaining k´s for R7
k=110M to 500M in a text-file - one k per line ?

Lalera-
Grab the list from the CRUS website [url]http://www.noprimeleftbehind.net/crus/Riesel-conjecture-base7-reserve.htm[/url] , and use a text editor to find/replace the comma with a carriage return. Problem solved!

Google can help you figure out how to create a newline/carriage return in your favorite text editor. You can use a similar process to add "*7^n-1" to each line.

[QUOTE=lalera;441939]hi,
to gd_barnes:
please, can i have a list of the remaining k´s for R7
k=110M to 500M in a text-file - one k per line ?[/QUOTE]

Here you go; attached.

hi,
reserving R7 k=110M-500M, n=25k-100k to sieve for BOINC

[QUOTE=gd_barnes;441958]Here you go; attached.[/QUOTE]

hi,
thank you for the file !

hi,
here is a sieve-file for R192
n= 50k to 100k
sieved to 6T

hi,
here is a sieve-file for R166
n= 25k to 100k
sieved to 7T