Micha,

On Nov. 15th 2008, you reserved k=520M-600M to n=25K for Riesel base 3. You completed k=520M-570M. Can you please complete k=570M-600M or unreserve the range? With testing having been otherwise completed up to k=700M and n=25K, this is currently a hole in the range. I'd like to have someone get it filled in.

Karsten,

On Jan. 6th 2009, you reserved k=700M-800M to n=25K for Riesel base 3.

On Sept. 9th 2008, you last reported a status on Riesel base 2 k=351134 at n=763K and k=478214 at n=1.103M.

Can you give us a status update on those? Also, do you have some results files available for what you have done so far?


Thank you,
Gary

Since I have not received a response to a request for status on the 2 Riesel base 3 reservations here, I am unreserving the ranges. It would be good if someone can fill in the k=570M-600M range at some point. If not done by then, I'll do it after I'm done with my Sierp base 31 reservation to n=25K, which should be ~2-3 months.

sorry for missing an update here from my reservation for a long time!

i've just continued my work in the range 700M<k<800M with my scripts.

for now i'm just at n=6700 so far with about 2700 k's left.
i will continue to n=25k to complete this range!

I'll take 570M-575M to n=25K. I might do more k's afterward. Are Karsten's Auto_Low and Auto_LLR, found [URL="http://www.mersenneforum.org/showthread.php?t=10864"]here[/URL], still the best way to do something like this? For this sort of n range, should I sieve between low and LLR?

Done, these 27 k's remaining:[code]570261376
570433384
570483226
570590744
571002396
571076834
571118406
571295884
571327914
571445824
571509922
571647792
571691058
571928646
572022064
572187422
572232098
572361596
572578152
572794036
573067036
573261672
573641974
573982644
574461462
574656416
574734512[/code]Not extending any more right now. Maybe later.

I used auto_low, sieving (with srsieve.exe for its low memory footprint and fast initialization), and PFGW.

[quote=Mini-Geek;194424]I'll take 570M-575M to n=25K. I might do more k's afterward. Are Karsten's Auto_Low and Auto_LLR, found [URL="http://www.mersenneforum.org/showthread.php?t=10864"]here[/URL], still the best way to do something like this? For this sort of n range, should I sieve between low and LLR?[/quote]

Sorry I missed the posts in this thread before you finished. Unfortunately I can't answer your questions about Karsten's automated scripts except to say that you should use PFGW not LLR for any base that is not a power of 2.

[quote=Mini-Geek;194482]Done, these 27 k's remaining:[code]570261376
570433384
570483226
570590744
571002396
571076834
571118406
571295884
571327914
571445824
571509922
571647792
571691058
571928646
572022064
572187422
572232098
572361596
572578152
572794036
573067036
573261672
573641974
573982644
574461462
574656416
574734512[/code]Not extending any more right now. Maybe later.

I used auto_low, sieving (with srsieve.exe for its low memory footprint and fast initialization), and PFGW.[/quote]


Tim,

Can you post or Email the primes for k=570M-575M and n>=1000 to me? That's what I've usually been asking people to do for new ranges on base 3 so that the files aren't too big. I can quickly run primes up to 1000 and that gives me a full list of them for historical reference.

In this case since it's only a k=5M range, if it's easier for you to send me all the primes and the file's not too big, that would work also.


Thanks,
Gary

Tim,

You've included multiples of the base in your k's remaining...10 of them to be exact. In all cases k-1 is composite so they should all be removed. Therefore, officially there are 17 k's remaining for k=570M-575M.

I thought Karsten's automated scripts took into account the removal of multiples of the base where k-1 is composite. If you used them, you might check the scripts or with Karsten to see why they weren't removed.


Gary

[quote=gd_barnes;194594]You've included multiples of the base in your k's remaining...10 of them to be exact. In all cases k-1 is composite so they should all be removed. Therefore, officially there are 17 k's remaining for k=570M-575M.[/quote]
At least now I know to remove k's like that. (it [I]is[/I] that k is a multiple of the base and k-1 is composite, right?) I vaguely knew about multiple of base, but guessed that the 'modular' script calls would take care of that.
[quote=gd_barnes;194594]I thought Karsten's automated scripts took into account the removal of multiples of the base where k-1 is composite. If you used them, you might check the scripts or with Karsten to see why they weren't removed.[/quote]
Hmm...well, I did make one modification that [I]might[/I] make a difference (don't think so). Karsten's do3.bat was:
[code]@echo off
call doranges 3 1 1
call modular 3 9 0
call modular 3 27 0
call modular 3 81 0
call modular 3 243 0
call modular 3 729 0
call modular 3 2187 0
call modular 3 6561 0
call modular 3 19683 0
call modular 3 59049 0
call modular 3 177147 0
call modular 3 531441 0
call modular 3 1594323 0
call modular 3 4782969 0
call modular 3 14348907 0
call modular 3 43046721 0
call doranges 3 2 1000
[/code]I got rid of all the 'modular' lines after the first one, for when I did 571-575, since when doing 570-571 it removed none after the first line. I supposed it's because 27, 81, ... are all multiples of 9 and so they're redundant. AFAICT nothing there was supposed to remove k's where b is divisible by k and k-1 is composite.
Removing all k's divisible by 9 wasn't wrong, was it? I just assumed Karsten's files would be set up to work right.

i haven't updated those script for a long time now.

there are 3 of them:

- [url=www.rieselprime.de/dl/Automated_low_n.zip]Automated Low n[/url]: doing small n-ranges upto n~1000 (with removing modulo-values like given on Gary's pages)

- [url=www.rieselprime.de/dl/AutomatedLLR.zip]Automated LLR'ing[/url]: doing higher n-ranges after sieving (still using cllr not pfgw!)

- [url=www.rieselprime.de/dl/MOB_base3.zip]Automated removing of MOBs[/url]: only a test for base 3 after running the first script

those scripts all need some more testing, especially the last one.

to do:
- replace cllr with pfgw
- i patched an older version of pfgw (with a HEXEditor) to suppress screen-outputs and therefore speed up the tests. this has to be done with the newest version, too.
- the third script has to be changed to use for other bases than 3.

hope this helps. if i got more time, i will try to update all scripts.
perhaps all three combined in one including some further sieving with srsieve.
so one call like:

[color=red]do <base> <conjectured k-value>[/color]

and all is done till end (end of time :grin:)

[QUOTE=kar_bon;194618]
there are 3 of them:

[/QUOTE]

Attached is my script. It can be used for any base, it filters out the multiple of that base. You can set the range for the k and the depth for the n. It gives two output files, one with all the primes/prps found (can be surpressed) and one output file with the remaining k.
I used this last month on base 40 Riesel conjecture. Gary doublechecked and confirmed my findings on the millions of primes I found.

Willem.