Riesel/Sierp #'s for bases 3, 7, and 15

[mdettweiler]

Originally Posted by michaf

Just the .pl script would be fine, I can run it here (or at least I think I can)

Okay, just a little warning though: there are a lot of Linux-specific commands hardcoded into it, so you'll have to modify those if you want to run it on Windows.

(Got your PM, will send you the script shortly...)

[robert44444uk]

I think it is great that base 3 might be capable of attack with brute force!!!! This would be an important challenge. I would be interesting in joining in the fun for n<1000 if an automated windows executable is developed.

[gd_barnes]

Originally Posted by michaf

Which k's were tested above 100M? I know only of my own 100-110M

Micha,

We're talking the Riesel side here. Check out the thread above where the 11-digit k-value is the RIESEL # and where you stated it would take 6300 runs of 10M k-values each. Your k=100M-110M was for the Sierp side. The Sierp conjecture has not changed. (As I've said before...too many bases floating around!)

Only KEP has worked on the Riesel side and his last status had him at k=2M and he had reserved up to k=10M. I think he plans to continue up to k=10M so you could do Riesels for anything k>10M.

I'm the only one working on the Sierp side now. My last status had me at k=15M but I'm now almost up to k=25M and n=25K. I'll post a status and the additional k's remaining when I get there. Of course then you did k=100M-110M and KEP did k=110M-120M.

If you work on the Sierp side, the gap of k=30M-100M should be filled in first. (My reservation now goes to k=30M.) Otherwise, as KEP found out for k=110M-120M, it gets very confusing determining the k's remaining because they need to be reduced as much as possible and then compared to lower k's that are already remaining, which usually eliminates some of them.

When I get a chance, I'll 'process' your k=100M-110M k-values remaining and get them listed on the web pages. I imagine that at least a few of them will reduce to k-values already remaining and hence can be eliminated. Others will be able to be reduced (i.e. divided by 3 or 9) but will still be remaining. (The 37M-40M k-values that you see currently remaining are reduced from KEP's k=110M-120M work.)

The web pages contain up-to-date reservation and completion info. for both Riesel and Sierp base 3 with the exception of your completion of the sierp k=100M-110M range.


Gary

[gd_barnes]

Originally Posted by robert44444uk

I think it is great that base 3 might be capable of attack with brute force!!!! This would be an important challenge. I would be interesting in joining in the fun for n<1000 if an automated windows executable is developed.

Just remember, we're talking only the Riesel base 3 conjecture that has been reduced and hence capable of a brute force attack.

[KEP]

I've actually already worked the 10M-100M k range up to n=5,000. But as soon as Anon sends me his program, I would really like to work on the entire Riesel Base 3 by myself, untill at least n=25,000. Not to be selffish, but to avoid spending precious cycles on doubleling each others efforts. So for evryone for the future Please ask me or at least check out my website before working on the Riesel Base 3, because it seems to be getting bit of a bad habbit that people doubles each others work and ressources is wasted :(

KEP!

[masser]

The Sierpinski side should be reducable using the same covering set. I am sure Willem can work that out.

[Siemelink]

Originally Posted by masser

The Sierpinski side should be reducable using the same covering set. I am sure Willem can work that out.

For the moment I am concentrating on the Riesels. Once I have the program in a satisfactory state I'll port it to do Sierpinski's as well.

Yesterday I ran my program while limiting the primes to 1000 or lower. This gave me the same answer as the one that we have now. When I use 1 more prime, 6831, my program gets so slow that it isn't worth to wait for the answer. There is one area that is clearly inefficient, but I have to think a bit before I know how to get it better.

Willem.

[michaf]

I'll be darned...

Sierp it was indeed for 100-110M...

and KEP, if you want it, it's all yours...
I'll send you a small pfgw script if you like,
that was what I was using when I got to 1M/hour (to n=1k)

it just goes from n=1 to n=1000, factoring with standard pfgw-setting, and testing if prime; when a prime found, skip to next k.

[KEP]

Originally Posted by michaf

I'll be darned...

Sierp it was indeed for 100-110M...

and KEP, if you want it, it's all yours...
I'll send you a small pfgw script if you like,
that was what I was using when I got to 1M/hour (to n=1k)

it just goes from n=1 to n=1000, factoring with standard pfgw-setting, and testing if prime; when a prime found, skip to next k.

I actually wasn't sure that I would really like to continue... but maybe you can send me in PM the script, then I shure may consider give it a try and continue attacking this major (yet very reduced challenge). However I don't get it, if nothing is differint from regular WinPFGW why is it faster and how about remaining k's, is there any easy way to recover those remaining without to much hassel when doing a single k up to n=1000?

KEP!

[KEP]

@Michaf:

It appears that you have the energy to carry out the Base 3 Riesel search, so would you like to take over the entire range, from k=>100M and complete these to n=25,000? I think it would be more fair for letting people who is more frequently around on the site (in stead of once a week, like me) to run these kind of challenges Also I seem to have had a hard time recovering from my latest illness, so for the time being I think I'll finish the ranges for Base 3 Riesel with n<=25,000 as mentioned here, and finish bringing Base 19 Sierpinski up to n<=100,000.

By the way: Thanks for taking interest in doing this Base 3 search, and thanks to our Hungarian user for bringing this down more than a million times. Now I actually think if the other big conjectures, both sierpinski and riesel, can be reduced, and we at somepoint can have a BOINC workframe or something like that, that we might actually be able to reach into the hundreds of bases before man returns to the moon or sets foot on Mars, anyone reading it as a challenge?

Take care!

KEP

[michaf]

Originally Posted by KEP

@Michaf:

It appears that you have the energy to carry out the Base 3 Riesel search, so would you like to take over the entire range, from k=>100M and complete these to n=25,000? I think it would be more fair for letting people who is more frequently around on the site (in stead of once a week, like me) to run these kind of challenges Also I seem to have had a hard time recovering from my latest illness, so for the time being I think I'll finish the ranges for Base 3 Riesel with n<=25,000 as mentioned here, and finish bringing Base 19 Sierpinski up to n<=100,000.

By the way: Thanks for taking interest in doing this Base 3 search, and thanks to our Hungarian user for bringing this down more than a million times. Now I actually think if the other big conjectures, both sierpinski and riesel, can be reduced, and we at somepoint can have a BOINC workframe or something like that, that we might actually be able to reach into the hundreds of bases before man returns to the moon or sets foot on Mars, anyone reading it as a challenge?

Take care!

KEP

Thanks, KEP,

I don't have the computerpower to run 8 cpu-years, unfortunately :(
this test was on a laptop, so maybe a 'normal' computer will be quicker.
The perfect thing about the script is, that it works sequential, so you can just start off where you left; a power-outage will now result in much less work to restart.

The script will output one file: it contains just the k's which have no primes upto 1k.

When I get the time, I'll try to write a script that takes it on from 1k onward on a more convenient non-intervening way (My script-writing skills need a LOT of honing, so I need the challenge :) )

Does anyone know what the maximum number of sequences is for srsieve?
This would largely determine the need for manual intervention...

KEP, I'll PM you the script in a sec