![]() |
117690*31^108349-1 is prime.
|
[quote=Flatlander;195071]117690*31^108349-1 is prime.[/quote]
Nice one Chris. Our 3rd top-5000 base 31 prime. This is becoming old hat for you. :smile: Riesel base 31 could be called "8-or-bust #2". :smile: With 8 k's remaining at n=100K, it now has 7 remaining. As heavy-weight as it is, this might be a fun one to make a team effort out of at some point. |
[quote] 117690*31^108349-1 is prime. [/quote]
Nice one Chris.:bow: Let's hope this is the start of another nice run. |
8579*10^373260-1 (373264 digits) it took me 18 hours to verify :smile:
|
[QUOTE=Cruelty;202167]8579*10^373260-1 (373264 digits) it took me 18 hours to verify :smile:[/QUOTE]
Great find! This is the third largest prime found by this project. Don't forget to submit it to the Prime Pages. |
[QUOTE=rogue;202170]Great find! This is the third largest prime found by this project. Don't forget to submit it to the Prime Pages.[/QUOTE]Thanks! I've already done that, see [URL="http://primes.utm.edu/primes/page.php?id=91482"]here[/URL]. I don't know why it doesn't appear on the status page...
|
[QUOTE=Cruelty;202174]Thanks! I've already done that, see [URL="http://primes.utm.edu/primes/page.php?id=91482"]here[/URL]. I don't know why it doesn't appear on the status page...[/QUOTE]
Probably because it hasn't been verified yet. |
1 Attachment(s)
[QUOTE=rogue;202176]Probably because it hasn't been verified yet.[/QUOTE]
see bottom of the pic! |
[quote=kar_bon;202181]see bottom of the pic![/quote]
According to the "**info" link shown in the picture: [quote]The fact that The Prime Pages allowed unmoderated submissions, attracted a variety of vandals. To minimize the damage these unstable folks cause, we have implemented a variety of moderation methods. For example, primes from new proof-codes (those with no proven primes) will not show until they are verified. Also, the smaller primes with comments will not appear until both the numbers and the comment are both fully verified. Even after these numbers and comments are verified, it may still be another hour until the primes show, because the system must update the database first. If you notice any troubles with these new measures, please let me know: [EMAIL="caldwell@utm.edu"][COLOR=#0000ff][EMAIL="caldwell@utm.edu."]caldwell@utm.edu[/COLOR][/EMAIL].[/EMAIL][/quote] I think this is Cruelty's first prime for this prover-code, so that would explain it. |
[quote=Cruelty;202167]8579*10^373260-1 (373264 digits) it took me 18 hours to verify :smile:[/quote]
Awesome find Cruelty! Congrats! Bring on the dancing Georges: :george::george::george: I think we need to concentrate all of our efforts on the 350000-380000 digit area. :-) That's 4 huge primes in that range out of 33 current top-5000 primes for the project! Gary |
8·158[SUP]123475[/SUP]+1 (271481 digits) proves conjecture S158.
|
[quote=Batalov;205295]8·158[sup]123475[/sup]+1 (271481 digits) proves conjecture S158.[/quote]
Excellent, great proof Serge! Whew, those powers-of-2 k's on the low-conjecuted Sierp bases are TOUGH to find a prime for. But when we do, they're huge! :smile: At 270K+ digits, this deserves a couple of dancing georges... :george::george: You having fun yet? :smile: |
Riesel base 110 proven
1 Attachment(s)
23*110^78120-1 is prime!
Last k eliminated. :smile: Results attached. |
[quote=vmod;209331]23*110^78120-1 is prime!
Last k eliminated. :smile: Results attached.[/quote] Hey, would you know! I released that base a while back and kept wondering if there was a prime just around the corner that I almost could have gotten...seems I was right. Go figure. :smile: Congratulations on a nice prime and a proof to boot! By the way, this prime is big enough to submit to the [url=http://primes.utm.edu/primes/]Top 5000 largest primes[/url] website. If you need instructions on how to do this, feel free to ask around. :smile: (If you've done this before by chance, then you'll need to credit your proof code to "[your name], CRUS, LLR, Srsieve" with LLR as the proof program since that's what it seems you used based on your output file.) |
[QUOTE]23*110^78120-1 is prime![/QUOTE]
Nice one vmod. Top5000 prime AND it proves the conjecture. :cool: |
one down for R30
225*30^158755-1 is 3-PRP! (821.7957s+0.0168s)
Those square k's are good for something after all. :smile: |
[quote=vmod;209331]23*110^78120-1 is prime!
Last k eliminated. :smile: Results attached.[/quote] Congrats on a nice proof! We love the conjecture proofs around here! :smile: |
[quote=Batalov;209341]225*30^158755-1 is 3-PRP! (821.7957s+0.0168s)
Those square k's are good for something after all. :smile:[/quote] Nice one. Whew, THAT has been a tough base to find primes for. Although we aren't completely filled in on all k's up to n=158K yet, we are at n>=110K on all k's and that was the first prime found since n=~50K. There were so many stubborn squared k's remaining on R30 that I was beginning to wonder if there was some sort of monsterous or infinite covering set or some kind of inordinately complex algebraic factorization that we were somehow missing on them. Well, that's why we test these things: to prove that they all have primes at some point, which is hideously difficult in many cases. Gary |
I have renamed this thread to "report top-5000 primes here". Previously the 1st post said to report "large and small" primes here but I think it caused confusion on whether people should report their primes in the reservation/status threads or here. So I've tweaked its wording accordingly. I've also renamed the reservation/status threads to reservation/status/primes threads.
What I'm attempting to do is get all information about the bases except top-5000 primes into the various bases 33-100, 101-250, etc. statuses/reservations threads. At times, I've found it very difficult to conjure up primes that were previously found because they were in multiple places. If people attach a file with primes, I'll usually remember to save it off but if people just list them, then I frequently don't remember to save them off. It's OK what people do either way. I just have to make sure that I have some sort of accounting or way to get back to previously posted primes if I don't save them off. I have now moved all posts to their respective reservation/status/primes threads. I took into account whether the prime(s) were top-5000 at the time that they were reported. To be more specific, please report all top-5000 primes here that are NOT found in team drives. The team drive threads are still intended for all statuses and primes related to that base after the time in which the drive was started, regardless of size. Thank you, Gary |
170*80^148256-1 is prime [URL]http://primes.utm.edu/primes/page.php?id=92430[/URL]
This leaves 3 k's on Riesel 80 (I'm taking them to n=200K) |
Nice one Ian! As the first prime since n=16237, those final 4 have been extremely tough on that base.
Shoot me your search depth on the remaining 3 and I'll reflect it on the pages. |
[QUOTE]Shoot me your search depth on the remaining 3 and I'll reflect it on the pages. [/QUOTE]
They are all at n=148.2K. |
[COLOR=Red][COLOR=Black]These primes were also reported with their completed range.[/COLOR]
4852*53^85259-1[/COLOR] [URL]http://primes.utm.edu/primes/page.php?id=91945[/URL] [COLOR=Red]536*53^85998-1[/COLOR] [URL]http://primes.utm.edu/primes/page.php?id=91994[/URL] [COLOR=Red]172*53^90603-1[/COLOR] [URL]http://primes.utm.edu/primes/page.php?id=92168[/URL] [COLOR=Red]3058*53^96037-1[/COLOR] [URL]http://primes.utm.edu/primes/page.php?id=92328[/URL] [COLOR=Red]382*53^99675-1[/COLOR] [URL]http://primes.utm.edu/primes/page.php?id=92467[/URL] I hope I covered all your bases Gary. LOL |
Impressive amount of work Ian. Well, you haven't gotten all 2046 bases covered yet but you're working hard on them. :smile:
|
A new Riesel-Base-5 prime was just verified: [url=http://primes.utm.edu/primes/page.php?id=92528]45742*5^303011-1[/url].
|
[quote=kar_bon;213457]A new Riesel-Base-5 prime was just verified: [URL="http://primes.utm.edu/primes/page.php?id=92528"]45742*5^303011-1[/URL].[/quote]
Excellent! Nice to see the base 5 project get one. The good part is that even though it's an odd exponent, since the k is low, it eliminates k*5 from Riesel base 25 with: 228710*25^151505-1 is prime :smile: |
[quote=gd_barnes;213468]Excellent! Nice to see the base 5 project get one.
The good part is that even though it's an odd exponent, since the k is low, it eliminates k*5 from Riesel base 25 with: 228710*25^151505-1 is prime :smile:[/quote] Speaking of which, I wonder why it hasn't been mentioned at the base 5 project itself yet? Also, their webpage hasn't updated to account for the new prime...I thought it was automatic though perhaps it isn't for primes. Also, I noticed that the prime was reported as found with "PRP" instead of "LLR"--presumably, then, the old LLRnet (and therefore LLR 3.5 which was still reasonably close enough to PRP's old code to be reported as that) was used instead of the new LLRnet or manual LLR, which would be reported with the "LLR" proof code. Considering the humongous speed penalty involved in using the older LLRnet for base 5, this is definitely quite a find. I'm surprised the person who found it hasn't upgraded yet. |
[QUOTE=mdettweiler;213472]I'm surprised the person who found it hasn't upgraded yet.[/QUOTE]
I think, he only used the old prover-code: it's the third Base-5 prime for him/this code. The [url=http://www.sr5.psp-project.de/r5stats.html]Riesel-Base-5 Stats[/url] shows 'rover' under "PRP Stats" with last results for 2010-04-28, but no new prime found (on top: "Days since last prime: 624" and bottom-table with open k-values no prime, too). |
Riesel base 36 prime
Tralala:
Primality testing [B]25679*36^98885-1[/B] [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 5, base 1+sqrt(5) 25679*36^98885-1 is prime! (8375.2145s+0.0123s) Submitted too, Willem. |
[quote=Siemelink;213543]Primality testing [B]25679*36^98885-1[/B] [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 5, base 1+sqrt(5) 25679*36^98885-1 is prime! (8375.2145s+0.0123s) [/quote] This one, [I]below[/I], is not top-5000, but just on the heels of your message, played with that R36 k-list: 15572*6^50383-1 is 3-PRP! (30.6225s+0.0014s) In other words [B]93432*36^25191-1[/B] is 3-PRP! (30.6225s+0.0014s) ...maybe, I'll take some of these k's... |
Nice find Willem.
|
[quote=Batalov;213558]This one, [I]below[/I], is not top-5000, but just on the heels of your message, played with that R36 k-list:
15572*6^50383-1 is 3-PRP! (30.6225s+0.0014s) In other words [B]93432*36^25191-1[/B] is 3-PRP! (30.6225s+0.0014s) ...maybe, I'll take some of these k's...[/quote] Be sure and let me know which k's you are taking. :smile: Base 36, like base 6, is a fairly "prime" base. To clarify: Many of its k's are going to be heavier weight than a lot of bases. |
I just noticed that the instructions in the first post of this thread said to report PRPs found with LLR and proven with PFGW with the PRP proof code. The currently accepted practice is to report them with the LLR code, since by now the code involved in doing PRP tests with LLR (even that for 3.7.1c which actually did PRP tests instead of 3.8's N-1/N+1's) has changed enough that it doesn't really make sense to credit the old PRP. I've changed the instructions accordingly (Gary, just wanted to give you a heads-up on this).
Edit: I just realized that, ironically enough, I was the one to first change it to PRP back in post #11 of this thread. The discussion that ensued clarified that it really should be LLR, but somehow it never got changed back. |
[quote=mdettweiler;214206]I just noticed that the instructions in the first post of this thread said to report PRPs found with LLR and proven with PFGW with the PRP proof code. The currently accepted practice is to report them with the LLR code, since by now the code involved in doing PRP tests with LLR (even that for 3.7.1c which actually did PRP tests instead of 3.8's N-1/N+1's) has changed enough that it doesn't really make sense to credit the old PRP. I've changed the instructions accordingly (Gary, just wanted to give you a heads-up on this).
Edit: I just realized that, ironically enough, I was the one to first change it to PRP back in post #11 of this thread. The discussion that ensued clarified that it really should be LLR, but somehow it never got changed back.[/quote] Well, you oughta change it back again. lol |
[URL]http://primes.utm.edu/primes/page.php?id=93045[/URL]
648*43^194123+1 is prime This leaves 166*43^n+1 the only k left for the conjecture. k=166 will be added to the 1 k remaining thread. It has been tested to n=194.1K also. |
Excellent! Nice prime Ian. You were due for one on that huge n=100K-200K effort you have going for numerous bases.
But...another 1k base. Ugh! :smile: |
Riesel base 476 is proven with a nice top-5000 prime:
[URL="http://primes.utm.edu/primes/page.php?id=93146"]49*476^72833-1[/URL] is prime! On a side note, the proof of this base now completes a run of five straight proven Riesel conjectures in numeric sequence. |
Nice one Max. 5 in a row AND 1 less on the recommended list and 1k list.
|
Congrats Max on CRUS's first group of 5 consecutive bases proven! :smile:
|
Dmitry found 14*333^69297-1 is prime. :smile:
I'm currently following up on whether he is searching the other 2 remaining k's for this base. |
302*333^90815-1 is prime!
|
74*666^60158-1 is prime!
|
[URL]http://primes.utm.edu/primes/page.php?id=93511[/URL]
26*557^63710-1 is prime (just like Karsten predicted) Conjecture proven - Results emailed |
[URL="http://primes.utm.edu/primes/page.php?id=93684"]8*202^155771-1[/URL] (359108 digits) proves R202.
|
Nice one Serge:bow:
|
7*608^87435-1 is prime - Conjecture proven
[URL]http://primes.utm.edu/primes/page.php?id=93711[/URL] Results emailed |
Great top-1000 primes Serge and Ian! :smile:
|
149*628^80423-1 is prime - Conjecture proven
[URL]http://primes.utm.edu/primes/page.php?id=94000[/URL] Results emailed |
Sierp 650
4*650^96222+1 is prime - Conjecture proven
[URL]http://primes.utm.edu/primes/page.php?id=94039[/URL] Results emailed |
[QUOTE=MyDogBuster;224404]4*650^96222+1 is prime - Conjecture proven
[URL]http://primes.utm.edu/primes/page.php?id=94039[/URL] Results emailed[/QUOTE] Nice find! I wish I could be so lucky with one of the single k'ers. |
Nice catch!
(Technically, it [I]is[/I] a Generalized Fermat, ...I mean, as well as any other N[SUP]2[/SUP]+1 would be.) |
34*677^82642+1 is prime - Conjecture proven
[URL]http://primes.utm.edu/primes/page.php?id=94070[/URL] Results emailed There coming fast and furious. |
4*679^69449+1 is prime - Conjecture Proven
[URL]http://primes.utm.edu/primes/page.php?id=94076[/URL] Results emailed I hit a nice pocket here. |
An outstanding run of primes Ian! ...and the 2 primes for the very difficult k=4 are a great coupe! :smile:
|
[URL="http://primes.utm.edu/primes/page.php?id=94180"]32*670^79644-1[/URL] (22508[B]2[/B] digits)
|
[URL="http://primes.utm.edu/primes/page.php?id=94435"]28*898^98959+1[/URL] is prime (292255 digits)
|
Hurray, I found a big one for my collection of prime riesel conjectures: 5503*48^140249-1
[url]http://primes.utm.edu/primes/page.php?id=94736[/url] Willem |
A reminder here to users of PFGW to upgrade to 3.3.6.
|
[URL="http://primes.utm.edu/primes/page.php?id=95017"]8*3^896701-1[/URL] (427837 digits) is prime. (proves R729)
|
Nice one Serge. :bow:
|
Sierp 893
8*893^86771+1 is prime [URL]http://primes.utm.edu/primes/page.php?id=95019[/URL]
Conjecture proven - Results emailed Is this Prime Saturday? |
[quote=Batalov;230296][URL="http://primes.utm.edu/primes/page.php?id=95017"]8*3^896701-1[/URL] (427837 digits) is prime. (proves R729)[/quote]
[quote=MyDogBuster;230370]8*893^86771+1 is prime [URL]http://primes.utm.edu/primes/page.php?id=95019[/URL] Conjecture proven - Results emailed Is this Prime Saturday?[/quote] A big congrats on a HUGE prime and proof Serge! Nice one Ian. 2 quick proofs in a row for you makes a total of 3 proofs today! Clarification: 8*3^896701-1 = 24*729^149450-1 |
Submitted this morning [URL="http://primes.utm.edu/primes/page.php?id=95170"]R31[/URL]
Primality testing 37328*31^129973-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 3, base 1+sqrt(3) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 37328*31^129973-1 is prime! (12989.0150s+0.0469s) |
Nice one Mathew. Your first for CRUS.
It also eliminated about 700 tests from the R31 run.:cool: |
Congrats Mathew. You were way overdue for one on the PRPnet drive.
|
Thanks Gary like you said Sierpinski bases on PRPnet have not been kind.
MyDogBuster, I see you got so jealous you had to get a prime the very next day :smile: |
[URL]http://primes.utm.edu/primes/page.php?id=95199[/URL]
101022*31^133208-1 is prime - conjecture has 4 k's left [QUOTE]MyDogBuster, I see you got so jealous you had to get a prime the very next day :smile:[/QUOTE] Had to catch up. LOL Next one breaks the tie. :devil: |
[QUOTE=MyDogBuster;232274][URL]http://primes.utm.edu/primes/page.php?id=95199[/URL]
101022*31^133208-1 is prime - conjecture has 4 k's left[/QUOTE] Nice. The conjecture actually has 5 k's left. k=6962 has already been searched to n=150K. R31 is becoming like R6. We may want to sieve this on up to n=250K and continue it for n=150K-250K. It would be nice to add such a high conjecture to the proven/1k/2k/3k thread. :smile: |
Riesel 859
[URL]http://primes.utm.edu/primes/page.php?id=95223[/URL]
26*859^90133-1 is prime - Conjecture proven Results emailed |
[QUOTE=MyDogBuster;232484][URL]http://primes.utm.edu/primes/page.php?id=95223[/URL]
26*859^90133-1 is prime - Conjecture proven Results emailed[/QUOTE] Congrats Ian, this prime is remarkable, since it is the 100th Top5000 prime CRUS has had on the list. Now next goal should be to make the actual Top5000 primes on the Top5000 list, for CRUS, an even 100 :smile: Looking forward to join you all early next year. KEP |
Riesel 908
[URL]http://primes.utm.edu/primes/page.php?id=95278[/URL]
8*908^61796-1 is prime - Conjecture proven Results emailed |
After an extended drought for me on top-5000 CRUS primes:
5886*28^206482-1 is prime! At 298,816 digits, it is my largest prime to date. :smile: This also finally ends an extremely long drought on top-5000 primes for bases in the 20s. There are still many k's to go needing top-5000 primes. It has been submitted but is currently hidden in the top-5000 status because it is the first prime for a new proof code. Gary |
[QUOTE=gd_barnes;233195]After an extended drought for me on top-5000 CRUS primes:
5886*28^206482-1 is prime! At 298,816 digits, it is my largest prime to date. :smile: This also finally ends an extremely long drought on top-5000 primes for bases in the 20s. There are still many k's to go needing top-5000 primes. It has been submitted but is currently hidden in the top-5000 status because it is the first prime for a new proof code. Gary[/QUOTE] Congratulations! You have indeed been quite overdue on top-5000 CRUS primes considering all the high-n work you've been doing on bases <32. Wow, you caught this one very quickly...I see it hasn't even been sent back to the PRPnet server yet. :shock: |
[QUOTE=mdettweiler;233196]Congratulations! You have indeed been quite overdue on top-5000 CRUS primes considering all the high-n work you've been doing on bases <32.
Wow, you caught this one very quickly...I see it hasn't even been sent back to the PRPnet server yet. :shock:[/QUOTE] I happened to see on my private PRPnet status page that there were two pairs that had been delayed by over an hour. Thinking that I had a core down, I investigated and saw the prime that was just finishing up its proof. What a nice surprise that was. Instead of a disconnected core, I had a prime instead! :smile: |
[QUOTE]5886*28^206482-1 is prime!
At 298,816 digits, it is my largest prime to date. :smile:[/QUOTE] It's about time. Nice one Gary. These things run in pairs so another one soon. :wink: |
S304
[URL]http://primes.utm.edu/primes/page.php?id=95363[/URL]
69*304^70969+1 is prime 60*304^n+1 is now a 1ker Results emailed - Base released |
[URL]http://primes.utm.edu/primes/page.php?id=95546[/URL]
4*480^93609-1 is prime - conjecture proven Results emailed |
Sierp 845
[URL]http://primes.utm.edu/primes/page.php?id=96566[/URL]
34*845^78106+1 is prime - Conjecture proven Results emailed |
Riesel 505
[URL]http://primes.utm.edu/primes/page.php?id=96622[/URL]
318*505^66148-1 is prime 68*505^n-1 changes to a 1ker - weight 1919 |
2548*148^85454+1 is prime! (185461 digits)
S148 down to 4 k's. |
S1016
[URL]http://primes.utm.edu/primes/page.php?id=96780[/URL]
103*1016^62932+1 is prime Conjecture proven - Results emailed |
Sierp 101
This is a good one.
[URL]http://primes.utm.edu/primes/page.php?id=96857[/URL] 2*101^192275+1 is prime Conjecture proven - Results emailed |
[QUOTE=MyDogBuster;241238]This is a good one.
[URL]http://primes.utm.edu/primes/page.php?id=96857[/URL] 2*101^192275+1 is prime Conjecture proven - Results emailed[/QUOTE] Congrats Ian on a huge proof! This eliminates the smallest base with k=2 remaining. The smallest is now R170. |
[URL="http://primes.utm.edu/primes/page.php?id=96903"]5840*117[SUP]96286[/SUP]-1[/URL] is prime
|
Sierp 567
Sierp 567
[URL]http://primes.utm.edu/primes/page.php?id=97241[/URL] 704*567^88673+1 is prime [URL]http://primes.utm.edu/primes/page.php?id=97262[/URL] 212*567^98259+1 is prime Conjecture proven - Results emailed Nice ck of 924 |
[QUOTE=MyDogBuster;244680]Sierp 567
[URL]http://primes.utm.edu/primes/page.php?id=97241[/URL] 704*567^88673+1 is prime [URL]http://primes.utm.edu/primes/page.php?id=97262[/URL] 212*567^98259+1 is prime Conjecture proven - Results emailed Nice ck of 924[/QUOTE] OUTSTANDING!! Your first 2k at n=25K conjecture proven! The most astounding thing of all on this is that the proof of base 567 with a CK=924 is the highest conjecture proven of any base on either side > 60!! :george: This is also the 5th-highest conjecture proven overall and all 5 of them have been on the Sierp side. |
[QUOTE]OUTSTANDING!! Your first 2k at n=25K conjecture proven![/QUOTE]
Actually it was the second 2ker - S289 was the first, but whose counting |
Sierp 579
Sierp 579
[URL]http://primes.utm.edu/primes/page.php?id=97265[/URL] 4*579^67775+1 is prime 6*579^n+1 is now 1 1ker with a weight=1366 Results emailed - Base released |
Smashing all personal records:
4336*148^103383+1 is prime! (224372 digits) S148 has now 3 k's left. I'll status this and others reservations in a few days. |
[QUOTE=vmod;247178]Smashing all personal records:
4336*148^103383+1 is prime! (224372 digits) S148 has now 3 k's left. I'll status this and others reservations in a few days.[/QUOTE] Congrats vmod on a large prime and adding a 3ker to our list! :smile: |
[QUOTE=gd_barnes;247222]...and adding a 3ker to our list![/QUOTE]
Make that a 2ker. :smile: 3193*148^104224+1 is prime! (226197 digits) |
[QUOTE]Make that a 2ker. :smile:
3193*148^104224+1 is prime! (226197 digits) [/QUOTE] Somebody's on a roll. :bow: Congrats |
[QUOTE=vmod;247548]Make that a 2ker. :smile:
3193*148^104224+1 is prime! (226197 digits)[/QUOTE] A great prime pair vmod! Just curious for reporting purposes on the pages: What is your current search depth on the other 2 k's and how high to you intend to search them? It's good that you surpassed your initial reservation of n=100K. :-) |
S737
S737 tested n=25K-100K
[URL]http://primes.utm.edu/primes/page.php?id=97673[/URL] 38*737^93785+1 is prime 4*737^n+1 is now a 1ker with a weight = 1117 Results emailed - Base released |
[QUOTE=gd_barnes;247718]You'll likely need 2-4 CPU months to test it to n=200K and the chance of prime by that point will be ~20%.
I just want you to be aware of the effort involved. Good luck! :smile:[/QUOTE] Well I guess I am a lucky prime hunter this time. What should my new proof code look like, i.e. which project(s) should I include? CRUS? SierpinskiRiesel? Thanks Peter |
[QUOTE=Puzzle-Peter;249311]Well I guess I am a lucky prime hunter this time. What should my new proof code look like, i.e. which project(s) should I include? CRUS? SierpinskiRiesel?
Thanks Peter[/QUOTE] Puzzle-Peter; Congrats on proving [URL="http://primes.utm.edu/primes/page.php?id=97761"]R170[/URL] and lucky you [URL="http://primes.utm.edu/primes/page.php?id=97685"]R5/R25 prime[/URL] Indeed a very good week for you. |
[QUOTE=Puzzle-Peter;249311]Well I guess I am a lucky prime hunter this time. What should my new proof code look like, i.e. which project(s) should I include? CRUS? SierpinskiRiesel?
Thanks Peter[/QUOTE] A big congrats, Peter, on proving one of our remaining k=2 bases! :smile: FYI for everyone's quick reference: 2*170^166428-1 is prime! The smallest base with k=2 remaining is now Sierp base 218, which has 2 k's remaining at n=100K. |
| All times are UTC. The time now is 09:14. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.