[quote=10metreh;216034]I am planning not to take it as far as 10K - that's too much for my resources. That's what the word "little" was there for. I don't know where I'll take it to, but the point was to actually get it started (split infinitive, but who cares?). And yes, I've taken the algebraic factors into account. It's annoying, but R51 was the lowest remaining untested conjecture by base.
I'll probably stop wherever I get by mid to end of August.[/quote]

OK, thanks...and I agree that it is annoying as the lowest one not yet tested. The next is base 63 with a CK of 187258666. I'll expect you to take that one next. :smile:

I forgot that it was you that gave a pretty decent proof (that is one that I could make some sense of) for my conjecture-attempt in the generallizing algebraic factors for Riesel bases thread...not sure why I thought I needed to inform you of them here. (rolls eyes!)

[QUOTE=gd_barnes;216036]I'll expect you to take that one next. :smile:[/QUOTE]

:lol:

And then R280 after that... :smile:

[quote=10metreh;216034]
I presume this means that the pattern for R51 is similar to that for other bases. R51 itself isn't there yet.[/quote]

Surely you jest! :smile:

he-he-he...

[quote=10metreh;216037]:lol:

And then R280 after that... :smile:[/quote]

Oh come on now. Be reasonable. R66 and R71 are waiting just for you. They don't even have any k's that can be eliminated by algebraic factors and their conjecture is < 1/10,000th of R280. Easy stuff.

:missingteeth:

[QUOTE=rogue;215850]I have a mod to srfile that can take the pfgw.log file with the -d switch and remove the k's. I have yet to pass that on to Geoff.[/QUOTE]

I have attached the source to srfile.c. Use this to rebuild the srfile application. With this mod -d will take either a sequence or a file. The file should be the same format as pfgw.log, one prime/PRP per line. In case anyone hasn't noticed the -d option never required the exponent to be a specific value, re, n, so using this:

srfile -d 123*456^789+1 srsieve.out

has always been perfectly acceptable.

Thanks for that Mark. I will definitely use it! :smile:

Funny thing about what you stated there: I had observed that you could type in variable for the exponent. I got tired of typing ^n so I just type ^y. The "y" is directly below the "^" on the keyboard so slightly quicker. But I had not tried typing more than one digit for the exponent such as for primes. That's useful to know.

For s19, I use a batch file to remove a k:

[CODE]srfile-x86-windows.exe -a -d "%1*19^n+1" sr_19.abcd
pause[/CODE]
Which is called with this line:
[CODE]delete-k.bat 123456[/CODE]

Maybe this helps?

[QUOTE=rogue;216073]I have attached the source to srfile.c. Use this to rebuild the srfile application. With this mod -d will take either a sequence or a file. The file should be the same format as pfgw.log, one prime/PRP per line. In case anyone hasn't noticed the -d option never required the exponent to be a specific value, re, n, so using this:

srfile -d 123*456^789+1 srsieve.out

has always been perfectly acceptable.[/QUOTE]

Two things to note. First, you should use "make clean" before making srfile. Second, for those of you with large ABC files who want to remove many k at one time, this is definitely the way to go. The reason is that using srfile iteratively to remove multiple k can take a really long time, while using srfile once to remove multiple k requires only one read and one write of the input and output files.

Hi, I'm new to CRUS, and have a short question which will could lead to a reservation.

If I get the informations correct we try to find primes for a certain base with certain k values like the 'bigger' project SeventeenOrBust.

If this is correct I'd like to reserve
1148*36^n-1
4737*36^n-1
7362*36^n-1
7399*36^n-1
8472*36^n-1
according to the Riesel-site they are unreserved.
I'l start sieving for n 25k - 100k.

If not than cancel this reservation (in this case I'll need more informations but will be back *g*)

[quote]Hi, I'm new to CRUS, and have a short question which will could lead to a reservation.

If I get the informations correct we try to find primes for a certain base with certain k values like the 'bigger' project SeventeenOrBust.[/quote]That's what we do. We are looking for the lowest n value for a k that is prime. There is no need to continue testing a k after finding a prime, unless you are looking for some Top 5000's. Welcome and happy hunting:tu:

[quote=MyDogBuster;216241]That's what we do. We are looking for the lowest n value for a k that is prime. There is no need to continue testing a k after finding a prime, unless you are looking for some Top 5000's. Welcome and happy hunting:tu:[/quote]

To add to that: We're like SOB times 2046 since that is how many bases that we encompass for both sides combined.

Base 36 is a good choice. It has shown to yield primes fairly easily.

Welcome. :smile: I'll show the reservation with the next regular web page updates; usually every 1-2 days.