Is expanding the Sierpinski base 63 reservation to at least n=131072 (2^17), is expecting to have all k's tested to n=5000 in less than 1 month and after that a huge sieving of all remaining k's can possibly begin for either the entire remaining n-range or for at least a part of the n-range :smile:

KEP

Sierp base 42 is complete to n=25K; 43 k's remain; unreserved.
Sierp base 100 is complete to n=25K; 5 k's remain; unreserved.

New reservations to bring more bases up to n=25K:

Riesel base 46 for n=10K-25K. I'll be able to sieve it in conjuntion with Sierp base 46 that I currently have reserved for n=15K-25K.

Sierp base 61 for n=16K-25K.

Riesel bases 75 and 80 for n=10K-25K. I'll be able to sieve Riesel and Sierp base 80 together for that n-range.

Riesel base 87 for n=20K-25K.

This leaves me with the following reservations for bases > 32 to n=25K:
Riesel bases 46, 75, 80, & 87
Sierp bases 46, 61, 80, 81, & 88


Gary

Riesel Base 58
 

94281*58^16014-1
98673*58^16045-1
72048*58^16110-1
4712*58^16135-1
81267*58^16182-1
90939*58^16285-1
51957*58^16294-1
73593*58^16302-1
73241*58^16365-1
55461*58^16439-1
25628*58^16469-1
41511*58^16610-1
92937*58^16610-1
2627*58^16774-1
41243*58^16830-1
42951*58^16946-1

Completed to 17000 and continuing

Riesel base 80 is at n=12K; 5 k's remain; continuing to n=25K

Sierp base 80 is at n=12K; 29 k's remain; continuing to n=25K

Riesel base 75 has now been fully sieved for n=10K-25K. I will start on it after finishing Riesel base 80.

Riesel base 80 is complete to n=25K; 4 k's remain; unreserved.

Sierp base 80 is at n=17K; 26 k's remain; continuing to n=25K.

Starting on Riesel base 87 for n=20K-25K. I'll do that before Riesel base 75 for n=10K-25K, which I will do after that.


Gary

Riesel Base 58
 

59166*58^17002-1
52922*58^17016-1
53832*58^17131-1
38922*58^17167-1
56562*58^17419-1
41931*58^17453-1
40505*58^17468-1
98942*58^17600-1
674*58^17613-1
4139*58^17820-1
102659*58^17852-1

Completed to 18000 and continuing

Riesel base 58
 

53328*58^18042-1
76194*58^18191-1
23958*58^18360-1
97587*58^18439-1
79422*58^18582-1
4341*58^18703-1

Completed to 19000 and continuing. I had found a prime for some of the k, so you can ignore those.

Riesel base 87 is complete to n=25K; 15 k's remain; unreserved.

Sierp base 80 is at n=22K; 23 k's remain; continuing to n=25K.

Now working on Riesel base 75 from n=10K-25K.

@ All:

I am unreserving my hundreds of Riesel reservations, since my computers is now guarenteed to be busy while on vacation, to someone else.

Regarding Sierp base 63, it appears that the 37% reduction is permanent, which should leave ~81112 candidates remaining at n=5000. If RAM allows it, I will conduct a sieving of the n=5001 to n=131072 (2^17) range, else I will get back with an update on how much I'm going to sieve. Also I don't thinkt that I will test further than n=25K, but if I decide to go beyond n=25K I will also get back on that case :smile:

Regards

Kenneth

Riesel base 75 is at n=16K; 16 k's remain; continuing to n=25K.
[Only one prime found since n=10K.]

Sierp base 80 is complete to n=25K; 23 k's remain; unreserved.

I'm now starting on Sierp base 81.

New reservation: Riesel base 95 for n=10K-25K.

In addition to Riesel base 75 and Sierp base 81 to complete, this leaves the following bases yet to be started on:

Riesel bases 46 and 95 for n=10K-25K.
Sierp bases 46, 61, and 88 up to n=25K.

I'm slowly but surely bringing the "reasonable" bases <= 100 on both sides up to n=25K.


Gary

Do you have any plans already for when you've finished with this effort?

I'm not sure what you're asking. I'll guess with two answers:

1. No, I'm not sure when I will complete the effort. It's just running on 2 slow laptop cores. The bases take widely varying amounts of time. I will say that it will take a couple of months unless I throw a couple of high-speed quad cores at it.

2. No, I don't have any plans for what I will do after I complete that effort. The two slow cores work on various misc. tasks.


Gary

[quote=gd_barnes;172215]
I'm slowly but surely bringing the "reasonable" bases <= 100 on both sides up to n=25K.

Gary[/quote]

I thought this was your goal, but I guess you are planning to go much further.
I'm just asking because I have some kind of reservation system in mind for k's/bases for crus which I'm planning to make after I've finished renovating my house.

[quote=MrOzzy;172243]I thought this was your goal, but I guess you are planning to go much further.
I'm just asking because I have some kind of reservation system in mind for k's/bases for crus which I'm planning to make after I've finished renovating my house.[/quote]

??

No I'm not planning to go much further than the bases shown as remaining reservations in my last post. My 2 cores are just slow and they don't run all of the time. :-)

Feel free to reserve whatever you want. If you'd like a couple of the bases that I have reserved but not started on as shown in the last status post then go right ahead. None of them are very big because the machine is slow. The Riesel bases are already at n=10K. The Sierp bases have been tested to varying amounts. If you take base 46, I'd suggest doing both Riesel and Sierp since they can be sieved together. That is the biggest reservation left remaining.

The Sierp side needs a lot more work than the Riesel side.


Gary

How is it possible to Sieve R and S together?

Riesel Base 58
 

85863*58^19006-1
74859*58^19045-1
79578*58^19258-1
92100*58^19783-1
39447*58^19798-1
75314*58^19961-1

Completed to 20000 and continuing

For the same base, srsieve and sr2sieve handle both forms k*b^n+1 and k*b^n-1 mixed within the same sieve. I haven't tried it but for the same base, it appears that srsieve can additionaly handle any c-value within the same sieve for the forms k*b^n+c and k*b^n-c. At least that is what the help file seems to imply.

I too didn't realize this until about 3 months ago. It's why I reserved both Riesel and Sierp bases 22 and 28. I was able to sieve both sides within the same sieve, gaining a large amount of efficiency. I think Cruelty did the same thing for base 10.

Riesel Base 58
 

23829*58^20072-1
59679*58^20453-1
99486*58^20473-1
23958*58^20564-1
27651*58^20657-1
53754*58^20929-1

Completed to 21000 and continuing

[quote=rogue;173144]23829*58^20072-1
59679*58^20453-1
99486*58^20473-1
23958*58^20564-1
27651*58^20657-1
53754*58^20929-1

Completed to 21000 and continuing[/quote]

Balancing note: k=23958 already had a prime at n=18360. 408 k's are remaining at n=21K.

Riesel base 75 is complete to n=23K; 16 k's remain; continuing to n=25K. No primes have been found for 16 k's since n=11585!

Sierp base 81 is complete to n=16K; 22 k's remain; continuing to n=25K.

Sierp base 88 is next on the agenda after Riesel base 75 is complete.

Riesel base 75 is complete to n=25K; 16 k's remain; now unreserved.

Sierp base 81 is at n=18K; 20 k's remain; continuing to n=25K.

I'm now beginning work on Sierp base 61 for n=16K-25K instead of Sierp base 88. After Sierp base 81 is done, I'll probably work on Riesel base 95 for n=10K-25K followed by Sierp base 88. I'll then finish up with both Riesel and Sierp base 46.

Riesel Base 58
 

63143*58^21116-1
67874*58^21172-1
3126*58^21270-1
74673*58^21320-1
31743*58^21397-1
84207*58^21428-1
51123*58^21561-1
73734*58^21723-1

Complete to 22000 and continuing

[QUOTE=gd_barnes;175001]Here's a nice one:

3104*22^161188-1 is prime :smile:


Gary[/QUOTE]

Grats!

Primality testing 2819*46^33458-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 3, base 1+sqrt(3)
Calling Brillhart-Lehmer-Selfridge with factored part 81.89%
2819*46^33458-1 is prime! (966.8294s+0.0237s)

Willem

Nice prime Willem. It will save me some testing on Riesel base 46.

By the way, I have some dormant reservations for you. They are:

Riesel base 7 k=315768, 328226, 477458, 623264, and 839022 at n=108K.

Riesel base 49 k=2186 at n=116K.

Can you give us a status update on those? Their last status was Nov. 30th, 2008.


Thanks,
Gary

[QUOTE=gd_barnes;175064]Nice prime Willem. It will save me some testing on Riesel base 46.

By the way, I have some dormant reservations for you. They are:

Riesel base 7 k=315768, 328226, 477458, 623264, and 839022 at n=108K.

Riesel base 49 k=2186 at n=116K.

Can you give us a status update on those? Their last status was Nov. 30th, 2008.


Thanks,
Gary[/QUOTE]


Sure. I've lost most of my computing power, so progress has been lacking. I just retrieved my sieve file for the base 7. I'll take it to n=120,000. it's almost there.
The base 49 is at 133,000. I've also done the stretch from 200,000 down to 189,000. I'll continue these until they meet. But that's at a snail's pace.
I've also started on Riesel 23, I'll take the remaining from 180,000 to 200,000.

Cheers, Willem.

Riesel Base 58
 

47994*58^22027-1
21422*58^22543-1
75807*58^22991-1

Completed to 23000 and continuing.

Sierp base 81 is complete to n=25K; 19 k's remain; now unreserved.

Sierp base 61 is at n=23K; 18 k's remain; continuing to n=25K.

I'm just now starting on Riesel base 95 for n=10K-25K.

After base 61 is done, I'll start on Sierp base 88 up to n=25K.

After that, to finish up my reservations for bases > 32, it will be Riesel and Sierp bases 46 up to n=25K.

Filling in lots of holes... :smile:

[quote=MrOzzy;175746]Riesel base 117 at n=66,5k no further primes.
2100s / test hurts ..[/quote]


Try 4000 secs per test for Riesel base 27 at n=200K. It had been running 3500 secs up until n=~196K. Needless to say, I stopped it at n=200K.

Riesel base 95 is at n=14K; 21 k's remain; continuing to n=25K

Sierp base 61 is complete to n=25K; 18 k's remain; now unreserved

I will start on new Sierp base 88 is the next couple of days; going to n=25K.

After that, only Riesel and Sierp base 46 to go.

I may reserve new Sierp base base 60 up to n=25K after all of that is done. I haven't decided yet. Besides Sierp base 88, it is the last remaining base <= 100 that is likely to have < 50 k's remaining at n=10K.


Gary

Riesel base 95 is at n=21K; 20 k's remain; continuing to n=25K.

Sierp base 88 is at n=10K; 25 k's remain; continuing to n=25K.

Next is Riesel and Sierp bases 46 to n=25K to complete current reservations.

New reservation: Sierp base 60 to n=25K.

Riesel Base 58
 

84977*58^23007-1
92229*58^23283-1
79011*58^23299-1
40808*58^23805-1
63177*58^24402-1
58086*58^24630-1
17876*58^24838-1
27861*58^24850-1
24320*58^24879-1

Completed to 25000 and continuing

Sierp base 88 is at n=15K; 20 k's remain; continuing to n=25K.

Riesel base 95 is complete to n=25K; 19 k's remain; now unreserved.

Sierp base 60 and both sides of base 46 to go for my reservations for bases > 32.

Sierp base 88 is complete to n=25K; 18 k's remain; now unreserved

Sierp base 60 is at n=5K; 65 k's remain; continuing to n=25K; status to be shown on web pages at n>=10K when fewer k's remain.

Riesel and Sierp base 46 have just completed sieving n=10K-25K. I'll test them concurrently.

Reserving Riesel base 94 up to n=60K. :smile:

Riesel Base 58
 

11484*58^25101-1
97164*58^25107-1
92712*58^25155-1
30612*58^25160-1
67547*58^25190-1
56841*58^25370-1
35774*58^25389-1
13682*58^25551-1
51894*58^25995-1

81114*58^26065-1
85617*58^26280-1
49146*58^26334-1
33266*58^26463-1
11538*58^26541-1
80579*58^26592-1
80180*58^26646-1
58314*58^26877-1
91766*58^26879-1
28008*58^26894-1

39684*58^27023-1
53636*58^27438-1
41469*58^27517-1
48156*58^27521-1
14396*58^27614-1
32118*58^27826-1

19854*58^28071-1
90279*58^28112-1
104724*58^28404-1
71598*58^28680-1
101715*58^28702-1

Completed to 29000 and continuing. If I have counted correctly, there are 360 remaining k.

[quote=mdettweiler;181145]Reserving Riesel base 94 up to n=60K. :smile:[/quote]
This finished to 60K quickly enough, so I've decided to take this up to 70K. I'll post results when that's completed.

Riesel base 94 is complete to n=70K; releasing this base. Results are attached for 51K-70K.

[quote=mdettweiler;181493]Riesel base 94 is complete to n=70K; releasing this base. Results are attached for 51K-70K.[/quote]
I've decided to not release this base quite yet. Continuing to 80K. :smile:

For Riesel base 58, after adjusting for one k that already had a prime, there were 408 k's remaining at n=21K per my note in a prior post. k's found prime for:

n=21K-22K; 8
n=22K-23K; 3
n=23K-24K; 4
n=24K-25K; 5
n=25K-26K; 9
n=26K-27K; 10
n=27K-28K; 6
n=28K-29K; 4 (k=19854 already had a prime at n=13287)

Total k's with primes for n=21K-29K: 49

Total k's remaining at n=29K: 408 - 49 = 359.


This also balances with the k's I show remaining on the web page. So somewhere you are off by 1. If you erroneously subtracted off k=19854 (or some other k) twice as a result of finding 2 primes for it and now have to add it back, you would be off by 2 so the error must be somewhere else.

You might check your k's remaining against my web page as well as remove k's with former primes like k=19854 from your sieve file to avoid any possible future confusion in that regard. I do a balancing every time I remove k's from the Riesel base 58 reservations web page.

Riesel base 46 is complete to n=25K; 17 k's remain; now unreserved.

Sierp base 46 is complete to n=25K; 30 k's remain; now unreserved.

Sierp base 60 is at n=10K; 50 k's remain; continuing to n=25K.

New reservation: Riesel base 60 for n=10K-25K. I'll sieve and test it concurrently with Sierp base 60. With 131 k's total combined, a lot of efficiency will be gained sieving them both at once.

Riesel base 94 is complete to n=100K; results attached for 70K-100K. Releasing.

Reserving Riesel base 93 for n=50K-100K. :smile:

Riesel base 60 is at n=12.5K; 7 primes found for n=10K-12.5K; 74 k's remaining; continuing to n=25K.

Sierp base 60 is at n=13.5K; 8 primes found for n=10K-13.5K; 42 k's remaining; continuing to n=25K.

Is taking Sierp base 63 to n=5K, ETA on sieving is sometime tomorrow or the day after tomorrow and after that I'll put 1 core on crunching the NewPGen (ABCD language) file, to n=5K. I expect there to be around 85612 k's remaining at n=5K for Sierp base 63, given the previously stated 37 % reduction is a stable removal of k's per doubleling of n value :smile:

Regards

Kenneth

That's a good target to go after for that monster base, Kenneth. Good luck! :smile:

Riesel base 60 is at n=16K; 12 primes found for n=10K-16K; 69 k's remaining; continuing to n=25K.

Sierp base 60 is at n=18K; 11 primes found for n=10K-18K; 39 k's remaining; continuing to n=25K.

Smoking along on one fast core each using the new version of PFGW. The substantially increased speed is great news for this project!

With the faster software, I'll be reserving 3 more Sierp bases and one Riesel base to n=25K as I get close to completing both sides of base 60 to n=25K. It's quite easy searching a base that is likelty to have 50 k's remaining at n=25K on just one fast core.


Gary

Just for fun, I tried using PFGW to take the first 5 k's of Riesel base 39 (all of which were at n=1K) and see how many I could knock out. I found three primes:

506*39^1059-1
346*39^1303-1
206*39^1377-1

The remaining two k's of the batch, 474 and 596, are at n=10K. I'll reserve these for n=10K+. Results are attached for n=1K-10K. :smile:

[quote=mdettweiler;183491]Just for fun, I tried using PFGW to take the first 5 k's of Riesel base 39 (all of which were at n=1K) and see how many I could knock out. I found three primes:

506*39^1059-1
346*39^1303-1
206*39^1377-1

The remaining two k's of the batch, 474 and 596, are at n=10K. I'll reserve these for n=10K+. Results are attached for n=1K-10K. :smile:[/quote]

Great! Isn't the faster PFGW awesome? PFGW is my favorite prime testing program anyway because it's so flexible. Now it's even better.

It's been a huge boon to my Sierp base 31 that has ~1600 k's remaining at n=~13.5K right now. The testing time savings on 1600 k's at such a n-depth is rather substantial. The other benefit: The stop on prime. I was previously using Phrot, which was still much faster than LLR or the old PFGW even without the stop on prime. The annoyance was that I had to stop it about every 1000n to remove the k's with primes...a tribulation that I didn't really relish. Now it just runs at break neck speed and I just copy off primes from time to time.

BTW, my time savings on the new PFGW vs. the most up to date Phrot was much less on Sierp base 31 than what most people are experiencing. I was getting about 50% more work done. The tests were coming in at 9 secs. vs. 13.5 secs. [(13.5-9) / 9 = 50%] I suspect that is because I'm testing a low n-range. I think the 2-5 times speed up that people are getting is at high n-ranges.

I dare you to take all 10000+ k's up to n=5K on base 39. lol

[quote=gd_barnes;183495]Great! Isn't the faster PFGW awesome? PFGW is my favorite prime testing program anyway because it's so flexible. Now it's even better.

It's been a huge boon to my Sierp base 31 that has ~1600 k's remaining at n=~13.5K right now. The testing time savings on 1600 k's at such a n-depth is rather substantial. The other benefit: The stop on prime. I was previously using Phrot, which was still much faster than LLR or the old PFGW even without the stop on prime. The annoyance was that I had to stop it about every 1000n to remove the k's with primes...a tribulation that I didn't really relish. Now it just runs at break neck speed and I just copy off primes from time to time.

BTW, my time savings on the new PFGW vs. the most up to date Phrot was much less on Sierp base 31 than what most people are experiencing. I was getting about 50% more work done. The tests were coming in at 9 secs. vs. 13.5 secs. [(13.5-9) / 9 = 50%] I suspect that is because I'm testing a low n-range. I think the 2-5 times speed up that people are getting is at high n-ranges.[/quote]
Indeed--the new PFGW is quite handy. Just today I discovered how useful the stop-on-prime option is, compared to Phrot's comparatively simpler stop-on-prime setting which stops the whole program on a prime (not just the k that found the prime).

Previously, the best option for having a k automatically stopped as soon a prime was found on it, without stopping the whole job, was to run a PRPnet server with the worktype set to Sierpinski/Riesel. Of course, that's still an option for when you want to combine the efforts of multiple cores or machines simultaneously, but it's nice to have a simpler option for simpler jobs. :smile:
[quote]I dare you to take all 10000+ k's up to n=5K on base 39. lol[/quote]
Yes, that's something I considered. Right now I don't think I'll have the resources to spare, though I might take you up on that one sometime in the near future. :smile:

Thanks Gary, I'm currently constructing the input file, which is going to be an effort that will most likely take approximately 24 hours to complete :smile: So with a little luck, by midnight tonight (local danish time) I'll start hammering out (hopefully) ~145000 k's that this current range will remove if the 37% removal rate is approximately constant. The RAM use by the way, when dealing with 237036 k's going a range from n=1001 to n=5000, is about 1 GB. Well as mentioned earlyer I'll consider if any further approach towards an attack on this base is worth my time and effort, as I reaches n=5K. But I'm just glad that this base may be taken below 100K k's remaining :smile:

Take care

Kenneth

[quote=gd_barnes;183495][(13.5-9) / 9 = 50%][/quote]
Wouldn't it be easier to calculate 13.5/9-1=50%?
[quote=mdettweiler;183496]Just today I discovered how useful the stop-on-prime option is, compared to Phrot's comparatively simpler stop-on-prime setting which stops the whole program on a prime (not just the k that found the prime).[/quote]
I didn't know PFGW had a stop-on-prime option! (I found the documentation for it now, and I'm not surprised I didn't know before...shouldn't it be more visible than a comment for the ABC file format?) What a handy feature, wish I knew about it when I was running that base 3 work the other day. :smile:
Is there a way to automatically verify that a PRP is prime?

[quote=Mini-Geek;183541]Is there a way to automatically verify that a PRP is prime?[/quote]
Not directly, though PRPnet will have PFGW verify any PRPs it finds.

[quote=mdettweiler;183548]Not directly, though PRPnet will have PFGW verify any PRPs it finds.[/quote]
Ok, thanks. Good enough for me, it's not a big deal to not verify immediately. I'm sure the odds are astronomical that any of them are actually composite (at least for the numbers from the base 3 work I'm running right now).

I got to n=26400 on my new CRUS base 3 reservation with no primes, which I thought was very odd, because I'd expect over 5 primes by that time and the odds of having 0 was under 1%, when I realized I had accidentally set it to run base 2 for those k and n's by mistake. :doh!: :doh!: :blush:
Since those numbers weren't sieved, I should've expected about 0.2 primes for the numbers I processed, which is much more in line with what I found: 0.
I've restarted it now with the correct base. I'm just glad I noticed it after a few hours instead of after a few days (when it would finish).

Just a quick question, maybe a rather stupid one, but is k*b^0+/-1 considered valid primes when dealing with conjectures or is a k first considered to be primed if n=>1? Just need to ask, since it can mean a difference of 25371 k's for Sierp. base 63. Hope to here from anyone who has the prober knowledge :smile:

Regards

Kenneth

[quote=KEP;183565]Just a quick question, maybe a rather stupid one, but is k*b^0+/-1 considered valid primes when dealing with conjectures or is a k first considered to be primed if n=>1? Just need to ask, since it can mean a difference of 25371 k's for Sierp. base 63. Hope to here from anyone who has the prober knowledge :smile:

Regards

Kenneth[/quote]

n=0 is not considered. Otherwise many specific k's for all bases could be easily eliminated. Example: k=4 would never remain for either the Riesel or Sierp side because 4*b^0-1 = 3 and 4*b^0+1 = 5. Both 3 and 5 are prime. n must be >= 1. That is shown on the web pages. There has to be an "effect" of the base. If n=0, the base would have no effect.

[quote=mdettweiler;183548]Not directly, though PRPnet will have PFGW verify any PRPs it finds.[/quote]

I don't think this is clear. You have to define "directly".

Tim, PFGW can prove primes when not running through PRPnet. You just have to "re-run" the PRP's that it finds back through it when you are done with the -tp option for Riesel PRP's and -t option for Sierp PRP's. It's slower to do the entire sieve file with one of those options so it's best to do a 2nd run on only the PRP's.

Yes, always use the stop on prime option in PFGW for the conjectures now. There is clearly no way to do any manual CRUS testing any faster at this point in time (that I am aware of). PFGW is a very powerful program and it is by far my favorite now that it is so fast. If you go through the various README and other helpful files, you'll see how powerful it is.


Gary

[QUOTE=gd_barnes;183598]I don't think this is clear. You have to define "directly".

Tim, PFGW can prove primes when not running through PRPnet. You just have to "re-run" the PRP's that it finds back through it when you are done with the -tp option for Riesel PRP's and -t option for Sierp PRP's. It's slower to do the entire sieve file with one of those options so it's best to do a 2nd run on only the PRP's.[/QUOTE]

PRPNet will use PFGW to do a primality test if the number is PRP. That is handled automatically by the client. And, of course, it can send an e-mail of the find directly to whomever is administering the project.

[quote=rogue;183601]PRPNet will use PFGW to do a primality test if the number is PRP. That is handled automatically by the client. And, of course, it can send an e-mail of the find directly to whomever is administering the project.[/quote]
@Gary: yes, this is what I meant. Perhaps "automatically" would have been a better choice of word than "directly". :smile:

Riesel base 39 k=474 is complete to n=50K. 596 was knocked out rather early in the 10K-50K range:

596*39^10649-1 is prime!

Results for 10K-50K are attached; continuing onward with 474. :smile:

Riesel base 60 is at n=21K; 62 k's remaining; continuing to n=25K.

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

New reservations:

Riesel bases 42 and 48 for n=10K-25K.

Sierp bases 52, 67, and 91 to n=25K.

These reservations should just about complete all of the "low hanging fruit" for bases <= 100; that is bases that are likely to have <= ~50 k's remaining at n=25K. Everything else not started will be a fair amount tougher likely ranging anywhere from > 50 k's remaining to millions of k's remaining at n=25K. (bases 7, 15, and 71 may fit the latter category)

After all of these are done, I'll likely start on tough Sierp base 25 up to n=25K. Having to convert base 5 primes to base 25, determine which base 5 k's remaining are the equivalent of ours, and list their converted high search limits from the base 5 project will be time consuming. But it is the last base <= 32 that is not b=2^q-1 (the really tough ones!) that has not been started yet so it'll be about time to get going with it starting in the next 2-3 months.


Gary

Riesel base 39 k=474 is complete to n=100K, no primes. Results for 50K-100K are attached.

Releasing this base. However, I did sieve all the way up to n=150K, so I've also included a sieve file for 100K-150K in the attachment.

Reserving Sierpinski base 43 for n=25K-100K.

Excellent! Finally someone is pushing the Sierpinski bases a little more. I've been the only one testing the Sierp side for bases 33-100 for quite a while now. You go Max! :-)

In other news: Reserving Sierp base 45 to n=25K.

Interim statuses: Sierp bases 45, 52, 67, and 91 are complete to n=5K. Bases 52 and 67 have completed sieving for n=5K-25K and both of those bases just started testing today. Bases 45 and 91 as well as the extention of Riesel bases 42 and 48 will wait until Sierp bases 52 and 67 are done to sieve and test.

I'll give more specific statuses once I'm past n=10K on them.


Gary

Riesel base 60 is complete to n=25K; 57 k's remaining; now unreserved.

Sierp base 52 is at n=13K; 67 k's remaining; continuing to n=25K.

Sierp base 67 is at n=13K; 72 k's remaining; continuing to n=25K.

Details shown on the web pages.

On the following, more details will be provided when I pass n=10K after the above two bases are complete:

Sierp base 45 is paused at n=5K; 99 k's remaining.

Sierp base 91 is paused at n=5K; 77 k's remaining.



Gary

Riesel base 93 k=424 complete to n=100K, no primes. Results for 50K-100K attached; releasing this k. Continuing with k=452 for the same n-range; ETA 1-2 weeks.

I had not removed 46293 from my input file. Other than that we match.

452*93^65264-1 is prime! :grin:

(Results for this k for n=50K-65264 are attached.)

Reserving Riesel base 100 for n=60K-100K. :smile:

Max, if your done with Riesel Base 39, I'd like to knock down the all the k's left to something reasonable. Does anyone have a txt file of the ramaining k's? The conjecture reservation list is a little hard to parse.

[quote=MyDogBuster;185584]Max, if your done with Riesel Base 39, I'd like to knock down the all the k's left to something reasonable. Does anyone have a txt file of the ramaining k's? The conjecture reservation list is a little hard to parse.[/quote]
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.

Thanks Max.

Riesel Base 39
 

[B]Riesel Base 39[/B]

Reserving the 14889 k's at n=1K. Testing to n=5K. Using PRPNet and PFGW.

[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.

Sierp base 45 is at n=21K; 58 k's remaining; continuing to n=25K.

Sierp base 91 is at n=18K; 39 k's remaining; continuing to n=25K.

Riesel bases 42 and 48 for n=10K-25K to start after these are done.

Riesel Base 39
 

Riesel Base 39

Tested from n=2K-3K. 1899 primes found (see attached file)

8898 k's remaining + the 1 I am not testing = 8899 left

Continuing

Riesel Base 58
 

37256*58^29445-1

24182*58^30234-1
49043*58^30709-1
84998*58^30872-1

84998*58^31553-1
68924*58^31737-1
30818*58^31946-1
60729*58^31965-1

53582*58^32291-1
65046*58^32355-1
61623*58^32433-1
22226*58^32731-1

63719*58^33604-1
4986*58^33903-1

101184*58^34068-1
77037*58^34078-1
92513*58^34093-1
642*58^34348-1
45152*58^34390-1
36054*58^34439-1

Completed to 35000 and continuing. They seem to be getting quite a bit more sparse.

1866*37^48305+1 is prime!
Only 3 more to go on Sierp. base 37. :smile:

[quote=rogue;187476]Completed to 35000 and continuing. They seem to be getting quite a bit more sparse.[/quote]

Yeah, base 58 is definitely a below average prime base. Compare it to Sierp base 91 that I'm near n=22K on. With a conjecture of ~85K (vs. your ~110K), it only has about 35-37 k's remaining. That would be a very prime base! :-) Even taking into account that only 4/15 of all k's are tested (due to trivial factors), that's still > 22000 k's that have a prime already found for them. Having such a small percentage of initial k's remaining for such a high base is very unusual.

A new potential analogy about the conjectures: In addition to bases where b=2^q-1, it appears that bases where b==(1 mod 30) are also quite prime bases. It's interesting that base 31 overlaps both of these and it is definitely one of the more prime bases. Bases 31, 61, and 91 all definitely have fewer k's remaining than the usual bases for their sizes and conjectures. Like above, I'm taking into account the fact that all only have 4/15 of their k's tested due to trivial factors so that doesn't explain their density of primes.

This analogy needs to be extended to base 121, 151, 181, etc. to see if it holds water. A further extension of it might be: Any base where b-1 contains a large # of factors is likely to be a very prime base.

I'd like to make a prediction at this point: Sierp base 31 with a conjecture of k=~6.4M will be easier to prove than Riesel base 58 with a conjecture at k=~110K! I'm taking base 31 to n=25K and I expect to have ~1000 k's remaining at that point. At the rate in which they are being removed and taking into account a lowering of that rate in the future due to lower average weight k's, I expect there to be ~500 k's remaining at n=100K. Although we may not see it in the foreseeable future, I think by the time Riesel base 58 and Sierp base 31 are nearing n=1M, base 31 will have fewer k's remaining!

BTW, I meant to ask you, what caused you to want to take such a difficult base to a higher limit?


Gary

[quote=mdettweiler;187632]1866*37^48305+1 is prime!
Only 3 more to go on Sierp. base 37. :smile:[/quote]

Good one Max!

With me getting multiple bases on the Sierp side up to n=25K now, it will be good to have people follow up behind me and bring many of them to n=50K and 100K, especially on the bases with < ~10-20 k's remaining.

The speedier PFGW has been a boon to this project! :-)

[quote=gd_barnes;187651]A new potential analogy about the conjectures: In addition to bases where b=2^q-1, it appears that bases where b==(1 mod 30) are also quite prime bases. It's interesting that base 31 overlaps both of these and it is definitely one of the more prime bases. Bases 31, 61, and 91 all definitely have fewer k's remaining than the usual bases for their sizes and conjectures. Like above, I'm taking into account the fact that all only have 4/15 of their k's tested due to trivial factors so that doesn't explain their density of primes.

This analogy needs to be extended to base 121, 151, 181, etc. to see if it holds water. A further extension of it might be: Any base where b-1 contains a large # of factors is likely to be a very prime base.

Gary[/quote]
i will be soon looking soon for bases to work on
i might help do some of this research
i can now work out trivial factors and k/base removal
i might need a little help with algebraic factors though

[quote=Siemelink;175292]
I have started on the remains of Riesel base 23. I'll take it from 180,000 to 200,000

Cheers, Willem[/quote]

Oh, the base 49 tests have reached 150,000 and I have run them from 180,000 to 200,000 as well.

Cheers, Willem.

Doing a lot of little stuff:

Reserving:

Riesel Base 80 all k's 25K-100K

Sierp base 45 is complete to n=25K; 53 k's remaining; now unreserved

Sierp base 91 is complete to n=25K; 35 k's remaining; now unreserved

Details to be shown on web pages when I get them updated for all CRUS efforts completed in the last week sometime on Thurs. or Fri.

Riesel bases 42 and 48 for n=10K-25K to start later today.

[quote=Siemelink;188429]Hi friend, I am ahead of you on this base 160. I've taken it to 30,000 already. Aha, I must have mentioned the reservation in the Base < 32 posts.

Willem.[/quote]

I have copied that post over to this thread. See post #467.

Willem, please separate the statuses on bases <= 32 and bases > 32 to avoid any future confusion.

Also, I need the results on this. Without them, it is best that it be double checked.


Thanks,
Gary

[quote=Siemelink;188438]
Oh, the base 49 tests have reached 150,000 and I have run them from 180,000 to 200,000 as well.

Cheers, Willem.[/quote]

Can you please provide full results up to n=150K on base 49?


Gary

[quote=gd_barnes;188440]
Can you please provide full results up to n=150K on base 49?

Gary[/quote]

Hi Gary,

The reason why I don't keep the residues is that my access to the other machines is spotty. Tracking residues becomes a bother that way.

Cheers, Willem.

[quote=Siemelink;188443]Hi Gary,

The reason why I don't keep the residues is that my access to the other machines is spotty. Tracking residues becomes a bother that way.

Cheers, Willem.[/quote]

Spotty as in once/week or once/month? A flash drive works quite well for copying residues off of little-accessed machines.