Riesel base 24is now at n=32,5
Sierpinski base 24 is now at n=33,9

Unfortunately I had too little time at the comp. to assess how many k's remain, but next time I'll update that too :)

It appears as though I won't get to 100k any time soon...

I have restarted Sierp base 12 k=404 and it is now at n=180K; no primes.

Continuing to n=200K, then will pause for a while to sieve further before continuing up to n=250K.

Sierp base 12 k=404 is at n=190K. Nothing to report. Continuing on...

Testing time jumped by ~30% from 3220 secs. to 4225 secs. at n=187.6K. (bleh!)

Whew, these higher bases take a long time just to get to n=200K for a single k!


Gary

[quote=michaf;139608]Riesel base 24is now at n=32,5
Sierpinski base 24 is now at n=33,9

Unfortunately I had too little time at the comp. to assess how many k's remain, but next time I'll update that too :)

It appears as though I won't get to 100k any time soon...[/quote]

n=100K is a HUGE undertaking for these bases that are NOT very prime!

On your ranges complete, I can't update anything on the web pages for base 24 without a # of k's remaining at the limits specified. For example on the Riesel side, it would be inaccurate to show the # of k's remaining at n=25K with a search limit of n=32.5K.

If you can do a quick count on your k's remaining at these limits, I'll go ahead and update both the ranges and k's remaining.


Thanks,
Gary

I'll now start the process of keeping at least some of my old promises, so for now, I'll reserve Sierp base 19 to n<=25K, and I'll do it this way:

1. PRP test up to n<=25K
2. Verify PRP tests
3. Remove k's from sievefile, and then maybe continue upwards towards n<=50K once further sieving has been added.

KEP!

Riesel base 31 is now at 90.8k, no additional primes to report.
Continuing...

[quote=gd_barnes;141077]n=100K is a HUGE undertaking for these bases that are NOT very prime!

On your ranges complete, I can't update anything on the web pages for base 24 without a # of k's remaining at the limits specified. For example on the Riesel side, it would be inaccurate to show the # of k's remaining at n=25K with a search limit of n=32.5K.

If you can do a quick count on your k's remaining at these limits, I'll go ahead and update both the ranges and k's remaining.


Thanks,
Gary[/quote]


Micha,

I didn't know if you saw the above post so I thought I'd repost it.


Gary

Yep, I've seen it, and next time I'm physically near the machine, I will count :)

[quote=gd_barnes;143051]Micha,

I didn't know if you saw the above post so I thought I'd repost it.


Gary[/quote]

update on Riesel base 7, 19 and 25
 

Hidiho,

I've found the following primes, they were checked with pfgw:
512222*7^88574-1

34710*25^21811-1
243840*25^21636-1
165390*25^21239-1
271896*25^20955-1
236742*25^20916-1
167808*25^20877-1
80508*25^20720-1
165216*25^20628-1
181206*25^20236-1

the progress for my various reservations is:
base 7: n = 95,000
base 19, k = 366: n = 200,000 and finished
base 25: n = 22,000
base 49: n = 104,000 and continuing until 200,000

enjoying my day, Willem.

[quote=Siemelink;143342]Hidiho,

I've found the following primes, they were checked with pfgw:
512222*7^88574-1

34710*25^21811-1
243840*25^21636-1
165390*25^21239-1
271896*25^20955-1
236742*25^20916-1
167808*25^20877-1
80508*25^20720-1
165216*25^20628-1
181206*25^20236-1

the progress for my various reservations is:
base 7: n = 95,000
base 19, k = 366: n = 200,000 and finished
base 25: n = 22,000
base 49: n = 104,000 and continuing until 200,000

enjoying my day, Willem.[/quote]



Great progress Willem! Thanks for the update.


Gary

KEP reported in an Email on 9/18 that he had completed Sierp base 19 to n=~14.2K and was continuing. 67 primes were found as shown below. There are now 1398 k's remaining.

Primes:
[code]
733236*19^12344+1
40116*19^12346+1
509596*19^12414+1
438616*19^12450+1
546976*19^12456+1
172338*19^12457+1
563316*19^12468+1
584106*19^12504+1
325804*19^12513+1
741564*19^12533+1
215706*19^12590+1
278764*19^12617+1
500926*19^12622+1
164016*19^12628+1
6696*19^12638+1
489160*19^12721+1
254946*19^12746+1
605154*19^12785+1
75034*19^12791+1
512374*19^12805+1
631804*19^12827+1
89176*19^12846+1
652234*19^12865+1
485746*19^12878+1
135972*19^12916+1
517866*19^13006+1
464946*19^13082+1
306666*19^13112+1
82674*19^13157+1
705046*19^13210+1
397444*19^13213+1
595614*19^13215+1
472216*19^13226+1
611536*19^13264+1
712914*19^13287+1
138676*19^13288+1
630016*19^13292+1
149316*19^13390+1
685626*19^13398+1
93934*19^13433+1
115636*19^13466+1
140494*19^13479+1
71356*19^13506+1
658204*19^13595+1
404686*19^13600+1
469734*19^13601+1
324106*19^13622+1
213366*19^13654+1
30616*19^13678+1
348814*19^13719+1
115014*19^13761+1
427146*19^13768+1
252196*19^13784+1
61744*19^13853+1
686214*19^13971+1
378076*19^13988+1
135456*19^13990+1
406306*19^14022+1
101094*19^14029+1
458824*19^14043+1
255706*19^14064+1
423714*19^14099+1
502954*19^14129+1
467926*19^14136+1
514564*19^14141+1
538294*19^14159+1
187596*19^14280+1
[/code]


Gary

I'd like to reserve all remaining base 10 k: 4421, 7019, 8579 from n=195000.
BTW: is there some software that would handle such tests more efficiently than LLR/PRP? I mean under both Windows and Linux :)

[QUOTE=Cruelty;143502]I'd like to reserve all remaining base 10 k: 4421, 7019, 8579 from n=195000.
BTW: is there some software that would handle such tests more efficiently than LLR/PRP? I mean under both Windows and Linux :)[/QUOTE]

phrot, but you will need Cygwin to run on Wnidows.

[QUOTE=rogue;143507]phrot, but you will need Cygwin to run on Wnidows.[/QUOTE] OK, right now I am into sieving for several weeks so I will have time to play with phrot... BTW: are there any compiled executables for Core2 architecture?

[QUOTE=Cruelty;143518]OK, right now I am into sieving for several weeks so I will have time to play with phrot... BTW: are there any compiled executables for Core2 architecture?[/QUOTE]

I have a MacIntel one, but that wouldn't be useful for you. I can help you with building (offline) if you need it. There are some issues with linking to YEAFFT that are a little tricky to work around.

[quote=Cruelty;143502]I'd like to reserve all remaining base 10 k: 4421, 7019, 8579 from n=195000.
BTW: is there some software that would handle such tests more efficiently than LLR/PRP? I mean under both Windows and Linux :)[/quote]


Cruelty,

Great! That's a base that should be interesting to push higher.

BTW, would you be interested in taking k=7666 on the Sierpinski side also from n=195K? It's the only remaining k and if you find a prime for it, it would prove the conjecture! :smile:


Gary

[QUOTE=gd_barnes;143553]BTW, would you be interested in taking k=7666 on the Sierpinski side also from n=195K? [/QUOTE] Consider it done :smile:
BTW: Is it possible to mix both "+" and "-" in one input file for LLR/Phrot? Personally I don't think so, but perhaps I'm wrong?

[quote=Cruelty;143559]Consider it done :smile:
BTW: Is it possible to mix both "+" and "-" in one input file for LLR/Phrot? Personally I don't think so, but perhaps I'm wrong?[/quote]
Yes, it is possible. From the LLR readme file:[QUOTE]Example:

ABC $a*2^$b$c
599 250001 -1
599 250001 +1

which is
599*2^250001-1
599*2^250001+1

These are the ABC forms accepted by LLR (from the readme file):

Fixed k forms for k*b^n+/-1 : %d*$a^$b+%d, %d*$a^$b-%d, %d*$a^$b$c
Fixed b forms for k*b^n+/-1 : $a*%d^$b+%d, $a*%d^$b-%d, $a*%d^$b$c
Fixed n forms for k*b^n+/-1 : $a*$b^%d+%d, $a*$b^%d-%d, $a*$b^%d$c
Any form of k*b^n+/-1 : $a*$b^$c+%d, $a*$b^$c-%d, $a*$b^$c$d

You can even change bases:

ABC $a*$b^$c$d
599 2 250001 -1
599 4 250001 +1

which is

599*2^250001-1
599*4^250001+1[/QUOTE]

[QUOTE=Cruelty;143559]Consider it done :smile:
BTW: Is it possible to mix both "+" and "-" in one input file for LLR/Phrot? Personally I don't think so, but perhaps I'm wrong?[/QUOTE]

Yes for both.

[quote=Mini-Geek;143565]Yes, it is possible. From the LLR readme file:[/quote]


Has anyone ever actually tried this with LLR? I have in the past and could not get LLR to work with ABC files. It seems to only accept NewPGen and srsieve -g and -G formatted files.

If someone would like to attempt this and can get it to work, please post exactly what you did because I have not been able to.


Gary

[quote=gd_barnes;143574]Has anyone ever actually tried this with LLR? I have in the past and could not get LLR to work with ABC files. It seems to only accept NewPGen and srsieve -g and -G formatted files.

If someone would like to attempt this and can get it to work, please post exactly what you did because I have not been able to.


Gary[/quote]
This works:[code]ABC $a*2^$b$c
599 100001 -1
599 100001 +1[/code]It returns this:[code]599*2^100001-1 has a small factor : 3 !!
599*2^100001+1 is not prime. Proth RES64: 422BF6EDE971AE37 Time : 18.773 sec.[/code]

[QUOTE=gd_barnes;143574]Has anyone ever actually tried this with LLR? I have in the past and could not get LLR to work with ABC files. It seems to only accept NewPGen and srsieve -g and -G formatted files.

If someone would like to attempt this and can get it to work, please post exactly what you did because I have not been able to.


Gary[/QUOTE]

Do you have the current version? It was added in 3.7.1c (IIRC).

[quote=rogue;143591]Do you have the current version? It was added in 3.7.1c (IIRC).[/quote]


Yep, I have 3.7.1c. I tried what Mini-geek did and it worked! Go figure.

I must have been doing something wrong before...not sure what it was. Thanks.


G

Sierp base 31 is now complete to n=7.7K. 2242 k's are remaining. See k's remaining and highest primes on the web pages.

Continuing on to n=10K.

As Micha has found on the Riesel side, this is a very prime base. The k's remaining are very few for such a large conjecture (k=6360528) and high base.


Gary

BTW: [I]srfile /w[/I] (PFGW) generates such an output: [code]ABC $a*10^$b+$c // Sieved to 1000000000 with srsieve
4421 195028 -1
7666 195161 1[/code] and it works under LLR :tu:

Status report: Base 31, riesel now at 94k.

Karsten

Did you find any primes on base 6 lately? A prime there can also knock out a prime for base 36 after all.

Willem.

[quote=Siemelink;144967]
Did you find any primes on base 6 lately? A prime there can also knock out a prime for base 36 after all.

Willem.[/quote]

no, not yet.
k=1597 is at n=167k
k=9577 is at n=110k
the other 11 k's at n=99k.
testing further!

base 9 Sierpinski. k=2036. I am in n= 270k no prime.

Gary I have sent you the results 260k-270k some days ago.

Riesel Base 6
 

after a long dry search for this base:

21799*6^99609-1 is prime!

Riesel base 7
 

Ah, that reminds me, I found some primes too:
347004*7^98164-1
949992*7^96234-1

That leaves 5 remaining k's for this base, even though these are not all k. I've sieved deeper and I'll take these to 200,000

Ciao, Willem.

[quote=Siemelink;145309]Ah, that reminds me, I found some primes too:
347004*7^98164-1
949992*7^96234-1

That leaves 5 remaining k's for this base, even though these are not all k. I've sieved deeper and I'll take these to 200,000

Ciao, Willem.[/quote]


Willem,

Nice finds!

Are you now up to n=100K on all k's for this base?


Gary

[quote=japelprime;145079]base 9 Sierpinski. k=2036. I am in n= 270k no prime.

Gary I have sent you the results 260k-270k some days ago.[/quote]

Thanks. Yes, I got them. I'm updating the web pages now.


Gary

[quote=KEP;146025]I'm not going to reserve any of these bases anyway. Even taking it to n<=25000 is more work than I really feels like doing anymore... so I'm wrapping my final works (8 weeks to go at least) amd then I'll decide what (if any) to reserve when that time comes. Sorry for yabbing again, but I made a mistake by simply forgetting how many more weeks of work I've left. Hope you understand and accept my appology... Anyway base 19 Sierp is going to be wrapped somewhere close to next weekend (maybe already the coming weekend) :smile:

Take care everyone and happy crunching :smile:

KEP[/quote]

?? You're doing it again KEP, stating different things on different days on huge efforts. On one hand, you want to reserve something to PrimeGrid level, which will be a multi-year CPU effort, and then on the other hand, you allow the fact that you have a few weeks on your current efforts to stop you? That is, to put it mildly, quite confusing.

Let me see if I have you down correctly now:
Riesel base 3 for k=250M-500M up to n=25K
Riesel base 3 for k<5M (2 k's) up to n=1M (!!)
Sieving sierp base 3 for k=50M-200M for n=25K-100K.
Sierp base 19 up to n=25K. (No primes posted since Sept. 18th so can't update n-range status)
Sierp base 252 k=27 up to n=100M. (No status since Sept. 14th)

The above is a tremendous amount of work for < 2 quads. I believe we calculated the last effort at ~50 CPU days.

If you need some filler work to keep your machines busy, please take something smaller; perhaps some files from the Riesel and Sierp base 3 mini-drives.


Thanks,
Gary

[quote=gd_barnes;146107]?? You're doing it again KEP, stating different things on different days on huge efforts. On one hand, you want to reserve something to PrimeGrid level, which will be a multi-year CPU effort, and then on the other hand, you allow the fact that you have a few weeks on your current efforts to stop you? That is, to put it mildly, quite confusing.

Let me see if I have you down correctly now:
Sierp base 19 up to n=25K. (No primes posted since Sept. 18th so can't update n-range status)

If you need some filler work to keep your machines busy, please take something smaller; perhaps some files from the Riesel and Sierp base 3 mini-drives.


Thanks,
Gary[/quote]

If it wasn't clear, I'm sorry, it all refers to some of the reasons earlier e-mailed to you. I suffered a setback this week, and also I forgot how much more work I've left. You've put my reservations right. Some status:

Sierp base 19 at:

Core 1: 20554
core 2: 20647
Core 3: 21439
Core 4: 22426


Again I ask you to accept my appologize, it all refers to private reasons, and a matter of concentration aswell memory. Expect no more reservations (or at least just ignore them) within the next 6 months, since my intention is to wrap what is now reserved and then leave for at least a while.

Thanks for understanding, and good luck on your own challenges :smile:

[quote=KEP;146134]If it wasn't clear, I'm sorry, it all refers to some of the reasons earlier e-mailed to you. I suffered a setback this week, and also I forgot how much more work I've left. You've put my reservations right. Some status:

Sierp base 19 at:

Core 1: 20554
core 2: 20647
Core 3: 21439
Core 4: 22426


Again I ask you to accept my appologize, it all refers to private reasons, and a matter of concentration aswell memory. Expect no more reservations (or at least just ignore them) within the next 6 months, since my intention is to wrap what is now reserved and then leave for at least a while.

Thanks for understanding, and good luck on your own challenges :smile:[/quote]


Thanks KEP for the detailed status on everything. If you shoot me some primes on base 19 at least up to your lowest core of n=20554, I can update the n-range status also. That's NICE progress on that tough base! :smile:


Gary

[quote=gd_barnes;146216]Thanks KEP for the detailed status on everything. If you shoot me some primes on base 19 at least up to your lowest core of n=20554, I can update the n-range status also. That's NICE progress on that tough base! :smile:


Gary[/quote]

Regarding the primes for Sierp base 19, I'll verify and e-mail the primes below n=20554, sort them by ascending n value and then e-mail those to you. It is more than 140 primes :smile:

KEP

:mad:

I thought that I did Riesel base 27 k=706 to n=300000, but I screwed up. I had to change the input file to ABC format, but used base 26, not base 27, so my results are worthless. What hurts even more is that I didn't find any primes, so I completely wasted my time. I'm releasing this for someone else to work on.

[quote=rogue;146309]:mad:

I thought that I did Riesel base 27 k=706 to n=300000, but I screwed up. I had to change the input file to ABC format, but used base 26, not base 27, so my results are worthless. What hurts even more is that I didn't find any primes, so I completely wasted my time. I'm releasing this for someone else to work on.[/quote]


I'm sorry to hear that. Thanks for a valiant effort there.

I have you reserved for both Riesel base 26 and Riesel base 27. Are you only releasing base 27 and still working on base 26? For now, I'm assuming you're only release base 27. I don't show a status from you on base 26 since May 9th.

We have a sieved file posted on the web page for base 27. Whatever you are deciding to release, do you, by chance, have a better sieved file than what we have posted for base 27 or any sieved file for base 26?


Thanks,
Gary

[QUOTE=gd_barnes;146363]I have you reserved for both Riesel base 26 and Riesel base 27. Are you only releasing base 27 and still working on base 26? For now, I'm assuming you're only release base 27. I don't show a status from you on base 26 since May 9th.[/QUOTE]

I'm still working on them.

[QUOTE=gd_barnes;146363]We have a sieved file posted on the web page for base 27. Whatever you are deciding to release, do you, by chance, have a better sieved file than what we have posted for base 27 or any sieved file for base 26?[/QUOTE]

No.

Here KEP is reporting 196 base 19 sierpinski primes:

[CODE]737944*19^14099+1
647776*19^14132+1
692164*19^14135+1
418366*19^14298+1
270924*19^14303+1
337306*19^14332+1
526014*19^14333+1
584176*19^14346+1
506214*19^14365+1
618208*19^14372+1
327154*19^14377+1
513036*19^14398+1
478716*19^14412+1
659166*19^14422+1
679066*19^14438+1
511696*19^14498+1
524784*19^14561+1
679986*19^14602+1
478894*19^14607+1
53016*19^14632+1
226714*19^14633+1
683556*19^14716+1
501924*19^14751+1
251988*19^14796+1
281496*19^14826+1
80134*19^14831+1
689646*19^14852+1
266796*19^14886+1
359814*19^14947+1
604266*19^15024+1
615306*19^15038+1
446316*19^15042+1
218116*19^15048+1
17526*19^15052+1
333544*19^15067+1
481804*19^15073+1
422374*19^15079+1
388384*19^15081+1
657306*19^15082+1
33594*19^15089+1
209526*19^15096+1
139674*19^15101+1
245506*19^15110+1
342714*19^15175+1
119716*19^15220+1
226686*19^15228+1
551154*19^15243+1
273976*19^15252+1
116206*19^15286+1
413824*19^15323+1
192456*19^15354+1
255426*19^15438+1
316584*19^15465+1
161094*19^15529+1
284176*19^15544+1
22216*19^15550+1
370606*19^15558+1
123540*19^15562+1
502794*19^15567+1
595134*19^15593+1
461086*19^15686+1
377464*19^15719+1
701584*19^15735+1
762364*19^15751+1
445266*19^15806+1
26176*19^15864+1
373284*19^15873+1
57424*19^15905+1
268386*19^15916+1
704284*19^15927+1
605364*19^15939+1
431826*19^15998+1
741124*19^16009+1
180946*19^16014+1
366654*19^16043+1
296014*19^16117+1
330444*19^16117+1
345066*19^16120+1
692116*19^16150+1
753204*19^16193+1
604894*19^16209+1
376194*19^16263+1
378624*19^16277+1
35974*19^16303+1
385006*19^16310+1
342726*19^16352+1
530116*19^16400+1
105904*19^16439+1
333624*19^16445+1
137416*19^16462+1
311596*19^16498+1
378136*19^16532+1
335226*19^16538+1
32436*19^16588+1
679146*19^16604+1
681886*19^16742+1
161634*19^16745+1
659724*19^16747+1
266136*19^16766+1
447906*19^16770+1
762126*19^16774+1
409216*19^16832+1
286576*19^16848+1
515826*19^16874+1
268944*19^16889+1
160204*19^16939+1
582894*19^16979+1
306526*19^17006+1
720226*19^17012+1
323614*19^17015+1
33504*19^17019+1
340414*19^17033+1
182646*19^17046+1
325084*19^17061+1
339054*19^17233+1
189426*19^17234+1
182224*19^17299+1
373564*19^17313+1
627544*19^17315+1
234636*19^17336+1
438286*19^17346+1
317266*19^17352+1
365886*19^17462+1
529804*19^17479+1
38974*19^17509+1
620346*19^17636+1
615994*19^17695+1
30616*19^17716+1
608064*19^17719+1
155394*19^17765+1
741406*19^17838+1
185404*19^17871+1
49486*19^17910+1
164574*19^18005+1
502276*19^18036+1
12850*19^18046+1
478524*19^18063+1
593904*19^18073+1
744796*19^18092+1
120844*19^18117+1
160794*19^18189+1
262914*19^18275+1
693556*19^18320+1
12720*19^18347+1
639646*19^18352+1
662766*19^18358+1
624406*19^18434+1
650764*19^18439+1
588936*19^18442+1
286*19^18524+1
226876*19^18532+1
472566*19^18626+1
118366*19^18638+1
692656*19^18656+1
724998*19^18671+1
273834*19^18713+1
321226*19^18716+1
445764*19^18717+1
673266*19^18752+1
437086*19^18770+1
495546*19^18788+1
606156*19^18790+1
376626*19^18832+1
494296*19^18934+1
509254*19^19001+1
403164*19^19003+1
526996*19^19012+1
727764*19^19117+1
153574*19^19123+1
673006*19^19144+1
141744*19^19157+1
547474*19^19277+1
182674*19^19323+1
252496*19^19352+1
238846*19^19442+1
348762*19^19478+1
742846*19^19492+1
336004*19^19499+1
626944*19^19635+1
604794*19^19661+1
89674*19^19751+1
315484*19^19819+1
558034*19^19825+1
761466*19^19850+1
361006*19^19932+1
155076*19^19966+1
372846*19^20064+1
162406*19^20174+1
185946*19^20260+1
219966*19^20422+1
283426*19^20472+1
320244*19^20501+1
477334*19^20507+1
87574*19^20511+1
97726*19^20566+1
218466*19^20570+1[/CODE]

Regards

KEP

[quote=KEP;146406]Here KEP is reporting 196 base 19 sierpinski primes:

[code]737944*19^14099+1
647776*19^14132+1
692164*19^14135+1
418366*19^14298+1
270924*19^14303+1
337306*19^14332+1
526014*19^14333+1
584176*19^14346+1
506214*19^14365+1
618208*19^14372+1
327154*19^14377+1
513036*19^14398+1
478716*19^14412+1
659166*19^14422+1
679066*19^14438+1
511696*19^14498+1
524784*19^14561+1
679986*19^14602+1
478894*19^14607+1
53016*19^14632+1
226714*19^14633+1
683556*19^14716+1
501924*19^14751+1
251988*19^14796+1
281496*19^14826+1
80134*19^14831+1
689646*19^14852+1
266796*19^14886+1
359814*19^14947+1
604266*19^15024+1
615306*19^15038+1
446316*19^15042+1
218116*19^15048+1
17526*19^15052+1
333544*19^15067+1
481804*19^15073+1
422374*19^15079+1
388384*19^15081+1
657306*19^15082+1
33594*19^15089+1
209526*19^15096+1
139674*19^15101+1
245506*19^15110+1
342714*19^15175+1
119716*19^15220+1
226686*19^15228+1
551154*19^15243+1
273976*19^15252+1
116206*19^15286+1
413824*19^15323+1
192456*19^15354+1
255426*19^15438+1
316584*19^15465+1
161094*19^15529+1
284176*19^15544+1
22216*19^15550+1
370606*19^15558+1
123540*19^15562+1
502794*19^15567+1
595134*19^15593+1
461086*19^15686+1
377464*19^15719+1
701584*19^15735+1
762364*19^15751+1
445266*19^15806+1
26176*19^15864+1
373284*19^15873+1
57424*19^15905+1
268386*19^15916+1
704284*19^15927+1
605364*19^15939+1
431826*19^15998+1
741124*19^16009+1
180946*19^16014+1
366654*19^16043+1
296014*19^16117+1
330444*19^16117+1
345066*19^16120+1
692116*19^16150+1
753204*19^16193+1
604894*19^16209+1
376194*19^16263+1
378624*19^16277+1
35974*19^16303+1
385006*19^16310+1
342726*19^16352+1
530116*19^16400+1
105904*19^16439+1
333624*19^16445+1
137416*19^16462+1
311596*19^16498+1
378136*19^16532+1
335226*19^16538+1
32436*19^16588+1
679146*19^16604+1
681886*19^16742+1
161634*19^16745+1
659724*19^16747+1
266136*19^16766+1
447906*19^16770+1
762126*19^16774+1
409216*19^16832+1
286576*19^16848+1
515826*19^16874+1
268944*19^16889+1
160204*19^16939+1
582894*19^16979+1
306526*19^17006+1
720226*19^17012+1
323614*19^17015+1
33504*19^17019+1
340414*19^17033+1
182646*19^17046+1
325084*19^17061+1
339054*19^17233+1
189426*19^17234+1
182224*19^17299+1
373564*19^17313+1
627544*19^17315+1
234636*19^17336+1
438286*19^17346+1
317266*19^17352+1
365886*19^17462+1
529804*19^17479+1
38974*19^17509+1
620346*19^17636+1
615994*19^17695+1
30616*19^17716+1
608064*19^17719+1
155394*19^17765+1
741406*19^17838+1
185404*19^17871+1
49486*19^17910+1
164574*19^18005+1
502276*19^18036+1
12850*19^18046+1
478524*19^18063+1
593904*19^18073+1
744796*19^18092+1
120844*19^18117+1
160794*19^18189+1
262914*19^18275+1
693556*19^18320+1
12720*19^18347+1
639646*19^18352+1
662766*19^18358+1
624406*19^18434+1
650764*19^18439+1
588936*19^18442+1
286*19^18524+1
226876*19^18532+1
472566*19^18626+1
118366*19^18638+1
692656*19^18656+1
724998*19^18671+1
273834*19^18713+1
321226*19^18716+1
445764*19^18717+1
673266*19^18752+1
437086*19^18770+1
495546*19^18788+1
606156*19^18790+1
376626*19^18832+1
494296*19^18934+1
509254*19^19001+1
403164*19^19003+1
526996*19^19012+1
727764*19^19117+1
153574*19^19123+1
673006*19^19144+1
141744*19^19157+1
547474*19^19277+1
182674*19^19323+1
252496*19^19352+1
238846*19^19442+1
348762*19^19478+1
742846*19^19492+1
336004*19^19499+1
626944*19^19635+1
604794*19^19661+1
89674*19^19751+1
315484*19^19819+1
558034*19^19825+1
761466*19^19850+1
361006*19^19932+1
155076*19^19966+1
372846*19^20064+1
162406*19^20174+1
185946*19^20260+1
219966*19^20422+1
283426*19^20472+1
320244*19^20501+1
477334*19^20507+1
87574*19^20511+1
97726*19^20566+1
218466*19^20570+1[/code]

Regards

KEP[/quote]


Thanks KEP. One thing: k=30616 already had a prime at n=13678. Therefore 195 k's are being removed and 1203 k's are remaining.


Gary

Did some OGR the last weeks, but I think I am back now.

Current status:
b17: one k remaining, n ~ 240K
b18: one k remaining, n ~ 235K

[QUOTE=gd_barnes;146463]Thanks KEP. One thing: k=30616 already had a prime at n=13678. Therefore 195 k's are being removed and 1203 k's are remaining.


Gary[/QUOTE]

Thanks for correcting my mistake. Don't really know how this happened, but I guess its a human factor there is to blame, since I manually removed the k's already primed, from the sieve file :smile:

Looking forward to see the update on the website. Also good idea to print out any prime above n=25000 for Riesel base 3, it really makes the conjecture websites more interesting :smile:

KEP!

[quote=rogue;146382]I'm still working on them.



No.[/quote]


Your use of the word 'them' has me confused again since I was only asking about 2 reservations, of which I thought you only had one still reserved. Let me spell it out...I now have you reserved for:

Riesel base 26 (last activity May 9th)
Sierp base 27 (last activity May 8th)

I RELEASED your reservation for:
Riesel based 27

Is that correct?

All these bases on both sides are confusing! (lol)


Thanks,
Gary

[quote=KEP;146506]Thanks for correcting my mistake. Don't really know how this happened, but I guess its a human factor there is to blame, since I manually removed the k's already primed, from the sieve file :smile:

Looking forward to see the update on the website. Also good idea to print out any prime above n=25000 for Riesel base 3, it really makes the conjecture websites more interesting :smile:

KEP![/quote]

The web pages were already updated last night for all of your primes.

I'm confused. There is already a web page of all known Riesel base 3 primes for n>=25K. See the link in the top-10 primes for Riesel base 3 on the main Riesel conjecture web page.

Perhaps you're referring to Sierp base 3. For that, I only list primes for n>=70K. I made the statement previously that it is in 'the works' to list all primes for n>25K for Sierp base 3. It will take me a little while to compile all of the primes from various sources including my laptop and desktop computers and the mini-drive and Karsten's drive here.

For Riesel base 3, I started listing all primes for n>25K right away so I don't have to go back and find them all.

Eventually, I plan to do something similar for all bases...that is list all of the primes of signficant size on a web page for ease of reference in the future. Only having the top 10 is not enough.


Gary

[QUOTE=gd_barnes;146589]Your use of the word 'them' has me confused again since I was only asking about 2 reservations, of which I thought you only had one still reserved. Let me spell it out...I now have you reserved for:

Riesel base 26 (last activity May 9th)
Sierp base 27 (last activity May 8th)

I RELEASED your reservation for:
Riesel based 27

Is that correct?[/QUOTE]

Yes. I intend to continue the other two ranges for a few more weeks (at most) before releasing them, assuming the ranges I am testing have no primes.

Sierp base 12 is at n=195K.

I paused it again to work on higher priority work. Sometime in the next 2 months, I'll put 4 quads on it for 5-6 days and complete it up to n=250K. At an hour per test at n=195K, that's about how much CPU power it will take to get it tested to n=250K.


Gary

i'm testing Riesel Base 15 with my new scripts.
for now i tested n<=1M.

the PRP's with n>500 are attached (smaller availlable on request).

there're 15 k's with no primes for n<15.5k:
[code]
135202
144400
193524
296686
298342
300870
381714
481292
527774
684682
853776
937474
940130
977666
986914[/code]

i'm testing further.
in combination for small n upto about 1000, i have the edit a little the tests with pfgw.
my intention:
with [b]one[/b] command/batch test a wide k-range standalone, running till end without any work by hand.
for now the deeper sieve have to manage per hand, all others is ok so far.

i am testing riesel base 15 1M>k<=2M
i have used the pfgw script that Siemelink posted in the Starting your own base 101 thread to test to n=1k after this i had 215ks left
after that i am using kar_bons fixed script to llr it
at n=2k i had 97ks left and at n=3k i have 53 ks remaining
i havent tested the prps to see if they are prime yet i will do that tomorrow

base 25 riesel
 

Here are the base 25 Riesel primes that I found between n = 22,000 and 25,000:
308268*25^22760-1
319548*25^23475-1
174708*25^23999-1
229932*25^24525-1
95874*25^24566-1
212382*25^24821-1
121566*25^24993-1

They were confirmed with PFGW.

Cheers, Willem.

base 25 riesel
 

Aloha.

I've reached n = 25,000 for my reservation for base 25. I won't be continuing with this one.

Laters, Willem.

i have checked all the prps up to n=8k
at n=4k i had 40ks remaining
at n=5k i had 30ks remaining
at n=6k i had 26ks remaining
at n=7k i had 19ks remaining
at n=8k i have 14ks remaining
for some reason i have less ks remaining at n=8k than kar_bon did at n=15.5k

[QUOTE=henryzz;147941]for some reason i have less ks remaining at n=8k than kar_bon did at n=15.5k[/QUOTE]

will check this perhaps late today.

i think i had a lucky streak earlier
at n=8k i had 14ks remaining
at n=9k i had 14ks remaining
at n=10k i had 14ks remaining
at n=11k i had 14ks remaining
at n=12k i had 12ks remaining
it has started to even out
i had no primes in 3k between n=8k and n=11k

i am currently at n=12.6k with 11ks remaining
these are the remaining ks:
[code]1069814
1323828
1347432
1529892
1531556
1570340
1588442
1632992
1877488
1878582
1932692[/code]

[quote=kar_bon;147678]i'm testing Riesel Base 15 with my new scripts.
for now i tested n<=1M.

the PRP's with n>500 are attached (smaller availlable on request).

there're 15 k's with no primes for n<15.5k:
[code]
135202
144400
193524
296686
298342
300870
381714
481292
527774
684682
853776
937474
940130
977666
986914[/code]

i'm testing further.
in combination for small n upto about 1000, i have the edit a little the tests with pfgw.
my intention:
with [B]one[/B] command/batch test a wide k-range standalone, running till end without any work by hand.
for now the deeper sieve have to manage per hand, all others is ok so far.[/quote]


Karsten,

I'm getting ready to verify this for inclusion on my web pages. You said there was an attachment with the primes. Did you forget that?


Thanks,
Gary

[quote=henryzz;147992]i think i had a lucky streak earlier
at n=8k i had 14ks remaining
at n=9k i had 14ks remaining
at n=10k i had 14ks remaining
at n=11k i had 14ks remaining
at n=12k i had 12ks remaining
it has started to even out
i had no primes in 3k between n=8k and n=11k

i am currently at n=12.6k with 11ks remaining
these are the remaining ks:
[code]1069814
1323828
1347432
1529892
1531556
1570340
1588442
1632992
1877488
1878582
1932692[/code][/quote]


I have a core or 2 that I generally dedicate to checking stuff like this. Generally on any new base that is started, I check primes and k's remaining up to n=2K, 3K, or 5K depending on the base. I'll run Riesel base 15 for k=2-2M and n<=5K and see if there are any problems that I see here.

It is very unusual for k=1M-2M to have so many less k's remaining at a lower search depth than k=2-1M. But it's very possible. You never know with primes.


Gary

[quote=gd_barnes;148056]I have core or 2 that I generally dedicate to checking stuff like this. Generally on any new base that is started, I check primes and k's remaining up to n=2K, 3K, or 5K depending on the base. I'll run Riesel base 15 for k=2-2M and n<=5K and see if there are any problems that I see here.

It is very unusual for k=1M-2M to have so many less k's remaining at a lower search depth than k=2-1M. But it's very possible. You never know with primes.


Gary[/quote]
that is probably wise especially as i think both of us are using rather new scripts
i am now up to n=14.4k
i have found a prime for 1878582 since my last report so 10ks remaining

Riesel Base 15: 2<k<=1M
 

i've forgot to attach the results.

i also made a mistake:
henryzz is searching 1M<k<2M and not k<1M like me.
i included all primes for n>50, the remaining pairs upto n=100k and the log-file here.
current n is 16181.
14 k's left

i have to check this with my new script again.

I would like to work on Riesel base 27 for a while. Has any work been done on the [URL="http://gbarnes017.googlepages.com/sieve-riesel-base27-100K-1M.txt"] sieve-riesel-base27-100K-1M.txt[/URL] file?

I have one core sieving and one core running Phrot from the beginning of the file. The sieve file seems to be running a bit faster but I'll be able to judge it better after a few more hours.
I've already tested to n>101k.
Tests are taking about 930 sec.
Sieving is removing candidates about every 700 sec.

[quote=Flatlander;148421]I would like to work on Riesel base 27 for a while. Has any work been done on the [URL="http://gbarnes017.googlepages.com/sieve-riesel-base27-100K-1M.txt"]sieve-riesel-base27-100K-1M.txt[/URL] file?

I have one core sieving and one core running Phrot from the beginning of the file. The sieve file seems to be running a bit faster but I'll be able to judge it better after a few more hours.
I've already tested to n>101k.
Tests are taking about 930 sec.
Sieving is removing candidates about every 700 sec.[/quote]


To the best of my knowledge, no work has been done on it.

Since the sieve file goes all the way up to n=1M, if you personally plan to only test it to, perhaps n=200K or 1/10th of the file, the file is well more than sieved enough for that range. Keep in mind that it is only removing 1/10th of the candidates in the 100K-200K range vs. the 100K-1M range. So for each n=100K-200K removal, it's removing them at about 1 every 7000 secs. It all depends on how far you plan to take it. If you don't find a prime, of course it helps save sieving time for future testers so any extra sieving of the entire file always helps in that regard.

Good luck with it! It's always fun to prove a base. That last one is almost always the hardest.


Gary

[quote=kar_bon;148076]i've forgot to attach the results.

i also made a mistake:
henryzz is searching 1M<k<2M and not k<1M like me.
i included all primes for n>50, the remaining pairs upto n=100k and the log-file here.
current n is 16181.
14 k's left

i have to check this with my new script again.[/quote]


I have run a check on all k<2M up to n=5K. Karsten, after removing your k's for primes n>5K, I balance exactly with what you have remaining. I'll post all primes and k's remaining for k<1M on the web pages shortly.

One thing that I'll mention: At any time, you could have removed k's that were divisible by 15 where k / 15 still remained. That would have saved you some testing time.

Henry, you'll need to provide me with a list of primes. Preferred would be all primes for n>500 but if you can at least post primes for n>5K, I can balance what you have remaining. Once you do that, I can update the web pages for k=1M-2M.

I show that there are 28 k's remaining at n=5K for k=1M-2M. This count removes k's divisible by 15 if k / 15 is still remaining.

Edit: I can indeed confirm that there are quite a few less k's remaining at the same testing limit for k=1M-2M vs. k<1M. Very unusual!


Gary

[quote=gd_barnes;148592]To the best of my knowledge, no work has been done on it.

Since the sieve file goes all the way up to n=1M, if you personally plan to only test it to, perhaps n=200K or 1/10th of the file, the file is well more than sieved enough for that range. Keep in mind that it is only removing 1/10th of the candidates in the 100K-200K range vs. the 100K-1M range. So for each n=100K-200K removal, it's removing them at about 1 every 7000 secs. It all depends on how far you plan to take it. If you don't find a prime, of course it helps save sieving time for future testers so any extra sieving of the entire file always helps in that regard.

Good luck with it! It's always fun to prove a base. That last one is almost always the hardest.


Gary[/quote]
Well, looking at the top ten primes, I've dusted off my slide rule and calculated that the probability of me finding a prime within weeks/months is exactly:
"Maybe."
But the probability of someone else finding a prime from this file after me is exactly:
"Probably."
That's why I'm sieving even though I'm unlikely to benefit much/at all.
Also, I can't put more than one core on testing because we are looking for the lowest prime.

(Talking of slide rules, I was given one of them to use for my first year at secondary school, then they took them away the next year and told us to buy calculators! Also, at my first school we were taught in imperial units but when I went to secondary school we switched to metric. So I say things like "5 feet and 3 cm".)

btw Searching to n=200k would be 1/9th of the file. :wink:

[quote=gd_barnes;148613]I have run a check on all k<2M up to n=5K. Karsten, after removing your k's for primes n>5K, I balance exactly with what you have remaining. I'll post all primes and k's remaining for k<1M on the web pages shortly.

One thing that I'll mention: At any time, you could have removed k's that were divisible by 15 where k / 15 still remained. That would have saved you some testing time.

Henry, you'll need to provide me with a list of primes. Preferred would be all primes for n>500 but if you can at least post primes for n>5K, I can balance what you have remaining. Once you do that, I can update the web pages for k=1M-2M.

I show that there are 28 k's remaining at n=5K for k=1M-2M. This count removes k's divisible by 15 if k / 15 is still remaining.

Edit: I can indeed confirm that there are quite a few less k's remaining at the same testing limit for k=1M-2M vs. k<1M. Very unusual!


Gary[/quote]
i have two files one for all primes n<1000 sorted by k and one with all the primes n>1000 which is below
if you want me to email you the other file i will do
it is 6.6mb uncompressed
[code]1072468 1006
1606146 1008
1574578 1016
1436120 1027
1560474 1030
1115812 1032
1720724 1034
1487226 1036
1404010 1043
1053682 1047
1346606 1048
1978384 1051
1077094 1060
1116890 1060
1972326 1065
1612900 1069
1841014 1069
1803906 1072
1815456 1072
1521268 1073
1499650 1074
1712340 1077
1480092 1080
1117682 1089
1347010 1094
1026294 1095
1369448 1095
1766032 1095
1169910 1096
1120634 1100
1663490 1117
1962788 1124
1158502 1125
1416270 1128
1860952 1129
1975986 1131
1867308 1138
1608066 1141
1681612 1143
1322764 1144
1972512 1148
1564044 1155
1093986 1165
1197366 1172
1798426 1177
1812858 1180
1245874 1184
1583694 1184
1160416 1195
1882258 1197
1817282 1199
1438618 1202
1079700 1224
1713112 1226
1302742 1236
1897384 1246
1470584 1257
1075182 1260
1872842 1266
1125422 1274
1798116 1276
1763258 1283
1141028 1294
1858156 1295
1488052 1296
1947040 1301
1199456 1315
1025468 1325
1054948 1335
1812988 1342
1991906 1358
1939480 1361
1924970 1368
1132366 1373
1718832 1382
1434526 1384
1612138 1427
1989740 1441
1743476 1451
1293564 1453
1887070 1470
1855566 1480
1715222 1482
1754804 1492
1336570 1520
1175372 1521
1549344 1539
1813116 1578
1290216 1581
1763412 1581
1099662 1590
1928030 1595
1454214 1603
1930270 1607
1684492 1621
1891178 1635
1983490 1637
1839414 1644
1878400 1649
1778098 1655
1847550 1678
1163050 1679
1837428 1683
1991168 1690
1208134 1703
1904388 1705
1783478 1712
1728576 1725
1355924 1741
1615222 1763
1434478 1836
1902052 1875
1587598 1917
1960126 1930
1411736 1952
1903788 1983
1261892 1997
1965872 2001
1571372 2003
1593850 2082
1303160 2098
1754464 2105
1237252 2124
1665414 2124
1401502 2139
1411056 2159
1617984 2159
1163498 2185
1020308 2193
1095700 2202
1035678 2229
1704660 2244
1009860 2246
1159494 2283
1319712 2304
1389108 2339
1883208 2355
1529734 2386
1603160 2415
1079904 2441
1733744 2448
1125670 2482
1380426 2484
1504306 2487
1812242 2532
1643262 2557
1611864 2602
1759328 2605
1169576 2626
1243344 2650
1893444 2669
1525122 2685
1392152 2708
1931208 2742
1946158 2770
1097834 2799
1101552 2862
1741240 2877
1432568 2892
1364474 2904
1070370 2938
1716420 2995
1954284 3094
1508434 3141
1593210 3208
1605302 3215
1219208 3457
1466048 3628
1993850 3631
1859548 3648
1227664 3679
1245410 3778
1117176 3859
1105592 3893
1046944 3909
1961964 4051
1605386 4069
1639034 4204
1024490 4232
1386014 4404
1919064 4422
1131758 4549
1925294 4887
1135190 4936
1304132 4960
1538474 5050
1937250 5176
1493958 5395
1474060 5725
1974600 6093
1461744 6191
1936564 6242
1222984 6658
1824626 6661
1927162 6765
1982148 6953
1359472 7072
1629142 7198
1692630 7299
1532818 7387
1748198 7992
1844870 11022
1152044 11482
1700990 12354
1878582 12950
1588442 14715[/code]

i am thinking of doing some base 3 sieving soon how much faster will it be per 1M ks than base 15 to take them to n=25k
if you find no errors in my base15 files i will use the same scripts

[quote=henryzz;148684]i have two files one for all primes n<1000 sorted by k and one with all the primes n>1000 which is below
if you want me to email you the other file i will do
it is 6.6mb uncompressed
[code]1072468 1006
1606146 1008
1574578 1016
1436120 1027
1560474 1030
1115812 1032
1720724 1034
1487226 1036
1404010 1043
1053682 1047
1346606 1048
1978384 1051
1077094 1060
1116890 1060
1972326 1065
1612900 1069
1841014 1069
1803906 1072
1815456 1072
1521268 1073
1499650 1074
1712340 1077
1480092 1080
1117682 1089
1347010 1094
1026294 1095
1369448 1095
1766032 1095
1169910 1096
1120634 1100
1663490 1117
1962788 1124
1158502 1125
1416270 1128
1860952 1129
1975986 1131
1867308 1138
1608066 1141
1681612 1143
1322764 1144
1972512 1148
1564044 1155
1093986 1165
1197366 1172
1798426 1177
1812858 1180
1245874 1184
1583694 1184
1160416 1195
1882258 1197
1817282 1199
1438618 1202
1079700 1224
1713112 1226
1302742 1236
1897384 1246
1470584 1257
1075182 1260
1872842 1266
1125422 1274
1798116 1276
1763258 1283
1141028 1294
1858156 1295
1488052 1296
1947040 1301
1199456 1315
1025468 1325
1054948 1335
1812988 1342
1991906 1358
1939480 1361
1924970 1368
1132366 1373
1718832 1382
1434526 1384
1612138 1427
1989740 1441
1743476 1451
1293564 1453
1887070 1470
1855566 1480
1715222 1482
1754804 1492
1336570 1520
1175372 1521
1549344 1539
1813116 1578
1290216 1581
1763412 1581
1099662 1590
1928030 1595
1454214 1603
1930270 1607
1684492 1621
1891178 1635
1983490 1637
1839414 1644
1878400 1649
1778098 1655
1847550 1678
1163050 1679
1837428 1683
1991168 1690
1208134 1703
1904388 1705
1783478 1712
1728576 1725
1355924 1741
1615222 1763
1434478 1836
1902052 1875
1587598 1917
1960126 1930
1411736 1952
1903788 1983
1261892 1997
1965872 2001
1571372 2003
1593850 2082
1303160 2098
1754464 2105
1237252 2124
1665414 2124
1401502 2139
1411056 2159
1617984 2159
1163498 2185
1020308 2193
1095700 2202
1035678 2229
1704660 2244
1009860 2246
1159494 2283
1319712 2304
1389108 2339
1883208 2355
1529734 2386
1603160 2415
1079904 2441
1733744 2448
1125670 2482
1380426 2484
1504306 2487
1812242 2532
1643262 2557
1611864 2602
1759328 2605
1169576 2626
1243344 2650
1893444 2669
1525122 2685
1392152 2708
1931208 2742
1946158 2770
1097834 2799
1101552 2862
1741240 2877
1432568 2892
1364474 2904
1070370 2938
1716420 2995
1954284 3094
1508434 3141
1593210 3208
1605302 3215
1219208 3457
1466048 3628
1993850 3631
1859548 3648
1227664 3679
1245410 3778
1117176 3859
1105592 3893
1046944 3909
1961964 4051
1605386 4069
1639034 4204
1024490 4232
1386014 4404
1919064 4422
1131758 4549
1925294 4887
1135190 4936
1304132 4960
1538474 5050
1937250 5176
1493958 5395
1474060 5725
1974600 6093
1461744 6191
1936564 6242
1222984 6658
1824626 6661
1927162 6765
1982148 6953
1359472 7072
1629142 7198
1692630 7299
1532818 7387
1748198 7992
1844870 11022
1152044 11482
1700990 12354
1878582 12950
1588442 14715[/code]

i am thinking of doing some base 3 sieving soon how much faster will it be per 1M ks than base 15 to take them to n=25k
if you find no errors in my base15 files i will use the same scripts[/quote]



This is a sufficient list of primes for my use. Everything looks great! There are officially 9 k's remaining for k=1M-2M. Can you provide me with an updated test limit? The last that you stated was n=14.4K. Since you have a prime for n=14715, I'll show n=14.7K. I'll update the web pages shortly.

BTW, you need to use a little punctuation. lol I can't tell if your 1st line is making a statement followed by asking a question or if it's just one big run-on sentence that is making a statement with a couple of words left out. If it's a question, can you ask it again?


Gary

[quote=Flatlander;148629]Well, looking at the top ten primes, I've dusted off my slide rule and calculated that the probability of me finding a prime within weeks/months is exactly:
"Maybe."
But the probability of someone else finding a prime from this file after me is exactly:
"Probably."
That's why I'm sieving even though I'm unlikely to benefit much/at all.
Also, I can't put more than one core on testing because we are looking for the lowest prime.

(Talking of slide rules, I was given one of them to use for my first year at secondary school, then they took them away the next year and told us to buy calculators! Also, at my first school we were taught in imperial units but when I went to secondary school we switched to metric. So I say things like "5 feet and 3 cm".)

btw Searching to n=200k would be 1/9th of the file. :wink:[/quote]


lol, you're right. It is 1/9th of the file! my bad

Why can't you put more than one core on it and still find the lowest prime? Do what I do when I want to test a range and have no gaps while testing: Sort the file into multiple files using a 1, 2, 3, 4, 1, 2, 3, 4, etc. sequence. Here's what I mean:

File one:
k/n pair 1
k/n pair 5
k/n pair 9
etc.

File 2:
k/n pair 2
k/n pair 6
k/n pair 10
etc.

File 3:
k/n pair 3
k/n pair 7
k/n pair 11
etc.

File 4:
k/n pair 4
k/n pair 8
k/n pair 12
etc.

This can be done by a cut-and-paste into Excel column A, then add a column B with 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, etc. in it, and then sort on column B. You don't need a secondary sort because even though all the 1's are the same, Excel doesn't change the position of rows unless the sorting requires it to. So it will keep the file in its original sequence within each occurrence of '1'. The same for each occurrence of '2', '3', and '4'. That way each of the 4 files is still in proper n-value sequence.

That way, you never have gaps in your testing unless one of the testing cores is significantly faster than another. In effect, it somewhat replicates what an LLRnet server does if you had 4 cores on one.

For base 27, you could test n=100K-200K that way. It'd be a lot of work for 1 core but on 4 cores running concurrently at the same n-range such as this, it wouldn't be too bad.

On a related note: I'm kind of tired of my Sierp base 12 effort crawling along on 1 core at n=196K (going to n=250K). At its current rate, it will take ~50-55 CPU days to get it up to 250K. In the next day or 2, I'm thinking of dividing it up on 3 quads with the files split up just like I am showing above. I'll just split it into 12 files using a 1,2,3,4,5,6,7,8,9,10,11,12,1,2,3,etc. sequence. That will knock it out in ~4-5 days if it doesn't find a prime but if it finds one, it will be the smallest. Then I can get back to other stuff and not have it tieing up a core.

I run many of my multi-core conjecture efforts this way. I'm currently running Riesel base 256 on 4 cores this way. It's currently at n=65K with no gaps below or above. If a prime is found, I stop all 4 cores and remove the k from each one of them, which are at the same n-range. The problem with dividing it up by n-range is that in the long run, it takes more CPU time because frequently you will have tested ranges much higher than the prime you find and those tests will have taken much longer. The point being: Those cores on higher ranges could have been used to find the smaller prime much more quickly by using the above tact.


Gary


P.S. BTW, I've actually done this on situations where one machine is significantly faster than another yet managed to keep them testing at the same n-range. The math gets a little tricky when deciding what numbers to put in column B but it can be done. If that is your situation and you want to do this, I could PM you with my method of doing it if you wanted. One thing that is a requirement: After you're done, it's important to merge and resort all of the results files by n-value/k-value to make sure you missed no tests. It's easy to miss or duplicate a result when messing around with resorting files like this.

my current test limit is n=21.5k

i presume it is the text after the primes that is the problem so i will restate that:
I am thinking of doing some base 3 sieving soon. How much faster will it be per 1M ks than base 15 to take them to n=25k?

[quote=henryzz;148788]my current test limit is n=21.5k

i presume it is the text after the primes that is the problem so i will restate that:
I am thinking of doing some base 3 sieving soon. How much faster will it be per 1M ks than base 15 to take them to n=25k?[/quote]


I assume no primes since n=14.7K.

Ah, OK. Makes sense now...lol...I can't quite answer your question fully because its dependent on a # of factors such as k-range chosen, how you choose to test it, etc. I will say this:

I think I remember that it generally took me around 1 CPU day to test every 1M k-range of base 3 to n=25K. That would be only 500,000 k's. So it'd be 2 CPU days or so to do 1M k's. Based on my testing of k=2-2M on base 15 to n=5K, I think that took just a little over 1 CPU day. I'd guess another 2-3 CPU days to get it up to n=25K.

Based on that I would estimate that it would take you about 4 times as long to test base 15 as it does to test base 3, both because base 3 is more prime and because its a lower base giving it even more opportunities for small primes. Less k's remaining, less testing time for those k's remaining at the same n-range means a big difference in total testing time. Trying doing a k=1M range like you did for base 15 and see if that's close.

Base 3 has its pros and cons:

Pro: A lot of primes so few k's remaining.

Con: A lot of k's that are powers of 3 times k's that are already remaining. It can be very tricky to weed out the correct k's and remove them. Base 15 is easier in that regard because there are less powers of 15 vs. powers of 3 in any given k-range, i.e. 15, 225, 3375, 50625, etc. vs. 3, 9, 27, 81, 243, 729, 2187, 6561, 19384, 59049, etc. I noticed that both you and Karsten had some k's remaining for a while in your base 15 testing that you didn't need to have but a prime was eventually found for all of them and so you ended up matching what I had remaining. It's not a big deal to be effectively double-testing k's below n=25K. Above that and it's wasting a lot of CPU resources.

Edit: I just now noticed this...Were you referring to sieving or primality testing on base 3 vs. base 15? Sieving would be only a little longer for base 15. Because base 15 is a higher base, you'll need to sieve it a little deeper to get to the optimal depth. Also, there will be more k's remaining within the same k-range. I'd say base 15 would take, perhaps, 30-35% longer than base 3 to sieve the same k-range.


Gary

Ok. I'll look into doing that on OpenOffice Calc.:smile:
(Or Office on the Kids' PC.)
At the moment I'm just sieving because I've already tested 4 unnecessary candidates.
Tested to >111k, sieving at >9T, >300 factors found.

It's difficult to know what is the best strategy with sieving/testing because we are just looking for the first prime. Hence, the uneasy feeling in my stomach that I've just stopped testing right before 'the' prime. :sick: lol

i dont know why i said sieving i meant primality proving
once my base 15 effort is finished to n=25k i will do 500000 ks from base 3 to n=25k
i have had a rather large gap between primes almost 1/3 of the range tested

[QUOTE=grobie;147568]I am going to reserve Riesel Base 45 k=24 to n=50k, if I am happy with this computer I might add more k's later.[/QUOTE]

Range is complete to n=50k, No Primes, let me know if you need the results file.

[quote=KEP;148866]Well then I think I've an answer to your previously question. Running 1M range (500,000 k's) to n<=25K, will take about 12 hours, if you only use OpenPFGW and starts out by doing some PRP testing at first, and eventually verifies the PRPs. So for administrative purpose i would suggest that you at least reserves 10M ranges or maybe 100M (dependent on the amount of cores you tent to put on this effort). I'm considering to launch an attack on a 1G range as soon as my Quad is done with the few important reservations she is working on :smile: This should take about 150 days from start to finish on the Quad (Q6600).

Also I may add, sieving is far more efficient from n>1000 (maybe n>2500) since trial division and factoring then starts to be to time demanding. But for the easyness of creating the proof later on, I'm considering to do it this way:

1. PRP test all k's reserved to n<1000
2. Sieve the k's remaining for n>1000 to n<=25000
3. PRP test all k's remaining in sieve file (for at most 1 prime per k)
4. Proof the PRP with n>1000
5. Proof the PRP with n<=1000
6. Release remaining k's to the public for further testing

This was my humble suggestions, but this seems to be the most efficient, however testing large ranges is with current technology bad, when talking about catching the PRP primes turning out to be actually composites. But the listed way, is the most effecient way and less risky of suffering various delaying setbacks. I've suffered many in my first 500M range, but a lot of new scripts has been developed and this really helps making it easier to go with large ranges.

Also a final notice, I've updated my Rb3a website, and Gary it appears that you've either one of your sites (the one with remaining k's) not updated or you have to many primes on your primelist. To crosscheck, I can mention that I've currently 215 primes listed and 973 k's remaining.

Regards

KEP[/quote]
thanks i think i will reserve a 10M range when i have a core free then
i only have four cores so i tend to not use more than one occasionally two cores per type of work

i have just found another prime
1570340 21918

[quote=grobie;148863]Range is complete to n=50k, No Primes, let me know if you need the results file.[/quote]

Yes, if you could post the results file or Email it to be at: gbarnes017 at gmail dot com ; that would be great.



Gary

Sierp base 12 is finally at n=200K...nothing to report; continuing on to n=250K.

Thanks to Max for speedy Phrot! My tests are ~40% faster: 3480 vs. 2090 secs. per test at n=195K!! :smile:


Gary

[QUOTE=gd_barnes;149243]Yes, if you could post the results file or Email it to be at: gbarnes017 at gmail dot com ; that would be great.



Gary[/QUOTE]

Here they are.

i am finally up to n=25k
i have found 2 more primes:
1531556 23098
1323828 23413
there are now 6 sequences left

115*26^n-1 has been tested to n=250000. No primes. I'm giving up on this one.

Sierp base 19 is complete to n=25K. Following 80 primes remains to be removed:

[code]
637294*19^20627+1
238444*19^20629+1
517116*19^20650+1
607674*19^20703+1
21634*19^20721+1
665074*19^20757+1
150184*19^20803+1
747784*19^20835+1
415314*19^20837+1
36814*19^20857+1
451284*19^20951+1
309114*19^20987+1
200616*19^21014+1
153936*19^21134+1
561846*19^21154+1
506106*19^21292+1
417436*19^21322+1
590044*19^21355+1
627804*19^21469+1
236346*19^21502+1
240304*19^21527+1
245914*19^21537+1
759196*19^21550+1
509746*19^21584+1
619306*19^21604+1
249664*19^21615+1
20646*19^21678+1
728446*19^21810+1
87826*19^21904+1
42766*19^21920+1
15874*19^22001+1
173136*19^22038+1
437776*19^22052+1
23014*19^22087+1
276714*19^22095+1
751434*19^22183+1
270156*19^22284+1
232264*19^22413+1
556194*19^22461+1
440784*19^22477+1
181326*19^22524+1
732016*19^22552+1
241234*19^22629+1
44056*19^22714+1
314206*19^22786+1
76644*19^22855+1
356586*19^22858+1
450594*19^22911+1
83154*19^22975+1
20556*19^22988+1
562176*19^23078+1
217786*19^23110+1
621316*19^23172+1
438534*19^23201+1
134686*19^23246+1
732226*19^23302+1
71034*19^23343+1
548676*19^23362+1
252436*19^23432+1
437574*19^23511+1
585196*19^23534+1
349366*19^23630+1
171406*19^23662+1
64044*19^23879+1
394176*19^23954+1
295554*19^23961+1
539664*19^23973+1
308656*19^24120+1
575676*19^24132+1
53974*19^24197+1
337146*19^24268+1
185656*19^24332+1
205294*19^24381+1
428466*19^24392+1
717004*19^24643+1
610564*19^24747+1
62044*19^24815+1
559066*19^24980+1
262456*19^24988+1
423064*19^24989+1
[/code]

Regards

KEP

[quote=KEP;149979]Sierp base 19 is complete to n=25K. Following 80 primes remains to be removed:

Regards

KEP[/quote]


Thanks for a nice effort on Sierp base 19 Kenneth. It's a very composite base so it will keep us entertained for many years! :smile:


Gary

Sierp base 12 now at n=210K.

Nothing new to report; continuing on...

398*27^n+1 completed to 400,000. No primes. I'm giving up.

[quote=rogue;150844]398*27^n+1 completed to 400,000. No primes. I'm giving up.[/quote]


Wow. Tough bases! Thanks for the huge amount of work!

Do you have results files that you could post for this one and your recently completed base 26 effort here?


Thanks,
Gary

[QUOTE=gd_barnes;150859]Wow. Tough bases! Thanks for the huge amount of work!

Do you have results files that you could post for this one and your recently completed base 26 effort here?

Thanks,
Gary[/QUOTE]

No. I had really expected them to fall long before I got as far as I did.

Riesel update
 

Hi Gary,

I am comparing my results with your excellent pages. Here is the difference:

Riesel base 7: I searched until n = 108,000, sieved until n = 200,000.

Cheers, Willem.

Riesel base 31
 

Riesel base 31 is now at 100k.

I have found no further primes :(

I'll be leaving this base alone for a while now...

Japelprime has reported completion to n=285K on Sierp base 9.

Reserving Sierp. base 23 k=8 up to n=125K. :smile:

Riesel Base 27
 

No joy finding the last prime for this conjecture. :cry:
[quote=gd_barnes;148592]... That last one is almost always the hardest.
Gary[/quote]That's something I'm appreciating more and more.

In fact, I'm going to write a book in your honour, :bow:, "The Wisdom Of G. D. Barnes".
"That last one is almost always the hardest."
"Primes are very strange."
"It won't be proven in our lifetime."
"I hate gaps."
"Everybody switch servers!!!"


Riesel base 27 tested to n=145k. Tests are now taking half an hour so I'm unreserving this.
I've pushed the sieve file to 10.8T. Results and sieve file attached. Factors removed from sieve file are available by request.

Chris :smile:

Reserving Riesel base 23 k=194 & 404 up to n=200K

[quote=Flatlander;152569]No joy finding the last prime for this conjecture. :cry:
That's something I'm appreciating more and more.

In fact, I'm going to write a book in your honour, :bow:, "The Wisdom Of G. D. Barnes".
"That last one is almost always the hardest."
"Primes are very strange."
"It won't be proven in our lifetime."
"I hate gaps."
"Everybody switch servers!!!"


Riesel base 27 tested to n=145k. Tests are now taking half an hour so I'm unreserving this.
I've pushed the sieve file to 10.8T. Results and sieve file attached. Factors removed from sieve file are available by request.

Chris :smile:[/quote]


:missingteeth::missingteeth::missingteeth::missingteeth::missingteeth:

ROFLMAO !! I about fell out of my chair on this one.

Perhaps I should be concerned though. Are you mocking me now? lol Even if you were, I'd still have to laugh. It's funny having your own words thrown back at you.

That leads me to this thought:
It's kind of amazing when people get into their 40's that many finally get comfortable with their own quirks. It is at that point that they finally tell others who have been giving them a hard time about being a certain way to just shut up and accept them like they are or leave. I've known many friends and relatives who have had the same revelation in their 40's. I suspect that it may be why many divorces occur during that age, myself included.

It also leads me to my own public revelation that I stated at a team lunch in front of many of my coworkers about 5 years ago, to which I got an uproarious laugh out of most of them because they knew me so well after having working with me several years already. That revelation was:

"I'm anal and detailed like my mom and I'm opinionated and annoying like my dad." :smile:

I even told my mom that I told my coworkers that. She laughed because she knows that she's overly detailed about stuff at times too.

I'm sure many of you here can see those qualities in my overly wordy posts at times. That's the way I am and it took me a long time to finally be comfortable with it. lol I thought some of you would find it interesting as to how they relate to my "real life" also.

Anyway, thanks for a good laugh! :smile:


Gary

[QUOTE]It's kind of amazing when people get into their 40's that many finally get comfortable with their own quirks.
[/QUOTE]

Wait till you turn 60. People will ignore your quirks, just chalking them up to old age. I too, have been very detailed oriented over the years and the older I get the less detailed I get because I just can't remember what I was going to be detailed about.

[quote=gd_barnes;152701]:missingteeth::missingteeth::missingteeth::missingteeth::missingteeth:

ROFLMAO !! I about fell out of my chair on this one.

Perhaps I should be concerned though. Are you mocking me now? lol Even if you were, I'd still have to laugh. It's funny having your own words thrown back at you.
Gary[/quote]
Well, teasing you in a respectful way. :smile: I find myself thinking about primes and semi-quoting you. 'Yes, these gaps [I]are[/I] very strange.' 'I wonder if we [I]can[/I] prove this in our lifetime.'
I sit and think a lot so I pick up on people's quirks sometimes.

[quote=mdettweiler;152448]Reserving Sierp. base 23 k=8 up to n=125K. :smile:[/quote]


Be sure and use the sieve file attached to the reservations web page. It includes both k's remaining on this base.

[quote=michaf;151715]Riesel base 31 is now at 100k.

I have found no further primes :(

I'll be leaving this base alone for a while now...[/quote]


Thanks for the huge effort on this base, Micha!

Can you give us a status on Riesel base 24 now?


Gary

[quote=gd_barnes;152857]Be sure and use the sieve file attached to the reservations web page. It includes both k's remaining on this base.[/quote]
Yep--I've been using the provided sieve file from the start. In fact, that's part of the reason why I picked this base to work on. :smile:

[quote=mdettweiler;152923]Yep--I've been using the provided sieve file from the start. In fact, that's part of the reason why I picked this base to work on. :smile:[/quote]


So then your testing both k's on the base?

[quote=gd_barnes;152957]So then your testing both k's on the base?[/quote]
No, I used srfile to split the provided sieve file into separate files for k=8 and k=68, and am only testing k=8. My plan is to, after I'm done with k=8, possibly do the same for k=68. (I figured I'd "test the waters" first with just one k, since I didn't know how hefty a job this would be. :smile:)