I understand ! :smile: ...so to get a valid certificate tooks an extra day.
I remember me to 2010 , where I finished also a certificate parallel under Primo for Windows.

[QUOTE=Cybertronic;598722]On 10th January, I wrote left time Phase 1 will be two weeks. This was correct :smile:.
The most time-ratio Phase1/2 is 4:1 ... so it tooks maybe another 3 or 4 months.[/QUOTE]

Your guess is about right. The first phase 2 number involved 3 weeks of factoring a degree 206 polynomial at ~49k digits. It nice to see that one finally cracked. So I am thinking the ides of May for the completion and verification of the certificate.

Paul, and even I thought, your post is: Certification done ! :smile:

[QUOTE=Cybertronic;599965]Paul, and even I thought, your post is: Certification done ! :smile:[/QUOTE]

(10^49081-1)/9 is now proven prime??? You can upload the certificate to [URL="http://factordb.com/index.php?id=1100000000013937242"]factordb[/URL], and also [URL="https://stdkmd.net/nrr/repunit/prpfactors.htm"]this page[/URL] should be updated.

[QUOTE=sweety439;600003](10^49081-1)/9 is now proven prime??? You can upload the certificate to [URL="http://factordb.com/index.php?id=1100000000013937242"]factordb[/URL], and also [URL="https://stdkmd.net/nrr/repunit/prpfactors.htm"]this page[/URL] should be updated.[/QUOTE]

No. It will be done by mid-May.

[QUOTE=paulunderwood;599964] The first phase 2 number involved 3 weeks of factoring a degree 206 polynomial at ~49k digits. It nice to see that one finally cracked.[/QUOTE]

No doubt caused by diggers on this gloriously sunny morning, I had a power cut/outage. This reset the first test back from cracking degree 91 back to degree 206. :cry: The cut should, however, only delay certification by 1 week. I need about 6 weeks of uninterrupted power supply -- a case for UPS.

Hello Paul !
>I need about 6 weeks of uninterrupted power supply

This is very hard at the moment. I hope not the best....maybe we get an attack to the power grid here in europe.

Maybe you find unsers which work for you on other Phase_2 points.


:cry:

I have also reduce my prime k-tuplet calculations.

Suggest to reserve these numbers:

* (64*10^10906+53)/9 (10907 digits), this prime is the smallest prime of the form 7111...1117, thus currently there is no known [I]proven[/I] prime of the form 7111...1117

* (6^10613-1)/5 (8258 digits), a generalized repunit PRP, an "a little" smaller generalized repunit prime (5^10949-1)/4 was proven prime in 2018

* 8*13^32020+183 (35670 digits), the smallest prime of the form 8000...000111 in base 13, if you prove the primality of this prime, you will full-prove the "[URL="https://primes.utm.edu/glossary/xpage/MinimalPrime.html"]minimal prime[/URL] problem base 13", see [URL="https://raw.githubusercontent.com/xayahrainie4793/mepn-data/master/data/minimal.13.txt"]this data[/URL] and [URL="https://cs.uwaterloo.ca/~cbright/reports/mepn.pdf"]this article[/URL]

* (23*7^9235-11)/6 (7806 digits), the smallest prime of the form 3555...5554 in base 7, proving the primality of this prime will complete the proof of the "[URL="https://docs.google.com/document/d/e/2PACX-1vQct6Hx-IkJd5-iIuDuOKkKdw2teGmmHW-P75MPaxqBXB37u0odFBml5rx0PoLa0odTyuW67N_vn96J/pub"]quasi-minimal prime problem[/URL] base 7", although this prime is not a quasi-minimal prime in base 7 (the "quasi-minimal prime problem base 7" is in fact already be proven, there are 71 quasi-minimal primes in base 7 and the largest of which has only 17 digits in base 7, but the proof of the "quasi-minimal prime problem base 7" include the large PRP (23*7^9235-11)/6

* 5^50669+31712 (35417 digits), if you prove the primality of this prime, you will full-prove the "mixed Sierpinski conjecture base 5", see [URL="http://www.kurims.kyoto-u.ac.jp/EMIS/journals/INTEGERS/papers/i61/i61.pdf"]http://www.kurims.kyoto-u.ac.jp/EMIS/journals/INTEGERS/papers/i61/i61.pdf[/URL] for the base 2 version, and there is 30 k < 159986 without known prime of the form k*5^n+1 with n>=1: {6436, 7528, 10918, 26798, 29914, 31712, 36412, 41738, 44348, 44738, 45748, 51208, 58642, 60394, 62698, 64258, 67612, 67748, 71492, 74632, 76724, 83936, 84284, 90056, 92906, 93484, 105464, 126134, 139196, 152588}, see [URL="http://www.primegrid.com/forum_thread.php?id=5087"]http://www.primegrid.com/forum_thread.php?id=5087[/URL] and [URL="http://www.noprimeleftbehind.net/crus/Sierp-conjecture-base5-reserve.htm"]http://www.noprimeleftbehind.net/crus/Sierp-conjecture-base5-reserve.htm[/URL], and we have these primes in the dual form (5^n+k):

[CODE]
5^24+6436
5^36+7528
5^144+10918
5^1505+26798
5^4+29914
5^50669+31712
5^458+36412
5^3+41738
5^9+44348
5^485+44738
5^12+45748
5^12+51208
5^46+58642
5^12+60394
5^2+62698
5^2+64258
5^10+67612
5^41+67748
5^13+71492
5^74+74632
5^7+76724
5^3+83936
5^21+84284
5^181+90056
5^23+92906
5^4+93484
5^11+105464
5^11+126134
5^1+139196
5^15+152588
[/CODE]

all of them except 5^50669+31712 are proven primes, thus if you prove the primality of 5^50669+31712, you will prove the "mixed Sierpinski conjecture base 5", i.e. the "mixed Sierpinski conjecture base 5" will become a theorem, like the base 2 case, when the primality of 2^16389+67607 was proven, the "mixed Sierpinski conjecture" become a theorem.

[QUOTE=Gelly;594054]looks like no one claimed it, and i've de-crufted my machine and set up, so i'm working on this candidate again!![/QUOTE]

done! took way longer than it should have for a variety of reasons (love my IceGiant cooler, but the fans fall apart LOUDLY), but we have another ECPP prime with 30k+ digits! currently working its way through the digestive system of factordb and, once it's independently verified, will send it over to primo and T5K.

will be taking a break on this machine while I move apartments.

[QUOTE=Gelly;604238]done! took way longer than it should have for a variety of reasons (love my IceGiant cooler, but the fans fall apart LOUDLY), but we have another ECPP prime with 30k+ digits! currently working its way through the digestive system of factordb and, once it's independently verified, will send it over to primo and T5K.

will be taking a break on this machine while I move apartments.[/QUOTE]

Marcel Martin can download the certificate from factorDB :smile:

Congrats on your 30k+'er, the largest proven Mersenne co-factor. :toot:

[QUOTE=paulunderwood;604247]Marcel Martin can download the certificate from factorDB :smile:
[/QUOTE]

It seems Marcel only displays [URL="http://www.ellipsa.eu/public/primo/records.html"]record-breakers now[/URL] -- no longer the top 20 Primo proofs.

[QUOTE=paulunderwood;604247]Marcel Martin can download the certificate from factorDB :smile:

Congrats on your 30k+'er, the largest proven Mersenne co-factor. :toot:[/QUOTE]

factordb seems to agree that it's prime, but the forward facing certificate doesn't appear to be available. not entirely sure what's going on there, as it says it's proven prime, but doesn't have an ECPP cert attached or anything.

i'll still attach the factordb entry to a t5k post but i'm still slightly unsure.

and yeah, i don't blame marcel for no longer posting all top 20s. seems to get updated a lot haha.

[QUOTE=Gelly;604793]factordb seems to agree that it's prime, but the forward facing certificate doesn't appear to be available. not entirely sure what's going on there, as it says it's proven prime, but doesn't have an ECPP cert attached or anything.

i'll still attach the factordb entry to a t5k post but i'm still slightly unsure.
[/QUOTE]

I'd say go ahead and report it to The Prime Pages at UTM and be assured in the knowledge that factorDB successfully verified the certificate.

ps. Do you fancy proving the [URL="https://www.mersenne.ca/exponent/78737"]co-factor of M78737[/URL]?

[QUOTE=Gelly;604793]factordb seems to agree that it's prime, but the forward facing certificate doesn't appear to be available. not entirely sure what's going on there, as it says it's proven prime, but doesn't have an ECPP cert attached or anything.

i'll still attach the factordb entry to a t5k post but i'm still slightly unsure.

and yeah, i don't blame marcel for no longer posting all top 20s. seems to get updated a lot haha.[/QUOTE]

I know that you mean [URL="http://factordb.com/index.php?id=1100000000013690992"]this number[/URL], a cofactor of the Mersenne number M106391, but why this number does not appear in the [URL="https://primes.utm.edu/top20/page.php?id=27"]top ECPP proving page[/URL]?

[QUOTE=sweety439;604882]I know that you mean [URL="http://factordb.com/index.php?id=1100000000013690992"]this number[/URL], a cofactor of the Mersenne number M106391, but why this number does not appear in the [URL="https://primes.utm.edu/top20/page.php?id=27"]top ECPP proving page[/URL]?[/QUOTE]

Are you [STRIKE]thick[/STRIKE] joking? I just posted that Gelly should submit to it to UTM. Until he does so it will not appear on the aforementioned top20 and at the top of the top20 Mersenne co-factors. Things don't magically happen -- some action is required!

[QUOTE=paulunderwood;604876]I'd say go ahead and report it to The Prime Pages at UTM and be assured in the knowledge that factorDB successfully verified the certificate.

ps. Do you fancy proving the [URL="https://www.mersenne.ca/exponent/78737"]co-factor of M78737[/URL]?[/QUOTE]

Listed at UTM. I don't feel super-comfortable not having a certificate that's accessible to people anymore, but it appears that is happening to most of my primo certificates at this point. May have to look into some method of hosting them myself.

And yes, I may give a try to that next cofactor. Still settling into the new apartment, but 23k is going to be more than three times as fast to prove, so it won't be too much longer after popping it in to get results.

Don't consider this a reservation for the time being, though!

Nearly finished:

M86137 cofactor prp25896

Dropping:

M86371 cofactor prp25984
M87691 cofactor prp26371
E(11848)/(5*1582043) prp40792

Reserving:

R86453

[QUOTE=paulunderwood;606277]Nearly finished:

M86137 cofactor prp25896

Dropping:

M86371 cofactor prp25984
M87691 cofactor prp26371
E(11848)/(5*1582043) prp40792

Reserving:

R86453[/QUOTE]

= = Are you sure that Primo can handle this large prime? Recently, the limit of Primo just extended from 40000 digits to 50000 digits, to make you can use Primo to prove R49081

Suggest you to prove (18^25667-1)/17 = R25667(18), this prime is also a generalized repunit, and is much smaller than R49081, this prime is interesting (much more interesting than R86453, you think R86453 is interesting is only because we use the number 10 as the base (radix) of our positional numeral system) is because this prime is the smallest generalized repunit prime in base 18 apart from 19 = R2(18), see [URL="https://oeis.org/A128164"]https://oeis.org/A128164[/URL]

[QUOTE=sweety439;606293]= = Are you sure that Primo can handle this large prime? Recently, the limit of Primo just extended from 40000 digits to 50000 digits, to make you can use Primo to prove R49081

Suggest you to prove (18^25667-1)/17 = R25667(18), this prime is also a generalized repunit, and is much smaller than R49081, this prime is interesting (much more interesting than R86453, you think R86453 is interesting is only because we use the number 10 as the base (radix) of our positional numeral system) is because this prime is the smallest generalized repunit prime in base 18 apart from 19 = R2(18), see [URL="https://oeis.org/A128164"]https://oeis.org/A128164[/URL][/QUOTE]

Primo won't handle anything above ~50k digits. But FastECPP (+GWNUM) might and do it some 8 times faster than an extrapolated Primo could do it.

[QUOTE=Gelly;604910]Listed at UTM. I don't feel super-comfortable not having a certificate that's accessible to people anymore, but it appears that is happening to most of my primo certificates at this point. May have to look into some method of hosting them myself.

And yes, I may give a try to that next cofactor. Still settling into the new apartment, but 23k is going to be more than three times as fast to prove, so it won't be too much longer after popping it in to get results.

Don't consider this a reservation for the time being, though![/QUOTE]

I only noticed this thread recently. I was just working on M78737 cofactor and just [URL="http://factordb.com/certoverview.php?pending=true"]uploaded[/URL] the cert. Hopefully no one else burned cycles on this...

[QUOTE=ryanp;606315]I only noticed this thread recently. I was just working on M78737 cofactor and just [URL="http://factordb.com/certoverview.php?pending=true"]uploaded[/URL] the cert. Hopefully no one else burned cycles on this...[/QUOTE]

Huh?

[QUOTE=ryanp;549836]I decided to fire up certification of M78737 with Primo, using 64 processes. Hopefully no one else is already running this!

The machine it's running on is a 3Ghz, 36-core/72-thread system. Anyone have a rough sense of how long this should take?

(Addendum: it would be great if Primo was open-source... I'd love to understand more about these "stk4321" processes it spawns. If I could farm these out to a cluster and then feed the results back in, presumably this could go a lot faster).[/QUOTE]

[QUOTE=kruoli;606320]Huh?[/QUOTE]

Somewhere in the messaging bowels, Ryan did mention he had forgotten about his Primo run of the M78737 cofactor and that Primo had crashed. Better late than never!

[QUOTE=kruoli;606320]Huh?[/QUOTE]

Yes, I had reserved this one a while back, then promptly forgot about it (beyond what I could do with Primo on a single machine).

@ryanp and @Andreas. Please make a The Prime Pages database entry for your numbers.

[url]https://primes.utm.edu/top20/page.php?id=49[/url]
[url]https://primes.utm.edu/top20/page.php?id=27[/url]

via

[url]https://primes.utm.edu/bios/[/url]

[QUOTE=paulunderwood;606326]@ryanp and @Andreas. Please make a The Prime Pages database entry for your numbers.

[url]https://primes.utm.edu/top20/page.php?id=49[/url]
[url]https://primes.utm.edu/top20/page.php?id=27[/url]

via

[url]https://primes.utm.edu/bios/[/url][/QUOTE]

I don't see Andreas' [C]ecpp[/C] software listed there. I attempted to create a new proof code using the existing FastECPP, but am not sure how to upload the prime + cert (just attempting to submit "(2^78737-1)/1590296767505866614563328548192658003295567890593" fails as it's too small).

[QUOTE=ryanp;606328]I don't see Andreas' [C]ecpp[/C] software listed there. I attempted to create a new proof code using the existing FastECPP, but am not sure how to upload the prime + cert (just attempting to submit "(2^78737-1)/1590296767505866614563328548192658003295567890593" fails as it's too small).[/QUOTE]

On [url]https://primes.utm.edu/primes/status.php[/url] I see Serge uses "CM" and an "x" code. UTM does not accept certs.

To be more explicit: create an x prover code attributing you and CM. When you submit the number append it with: Mersenne cofactor, ECPP

Reserving [URL="http://factordb.com/index.php?id=1100000000017751314"]W117239[/URL].

I'd also like to take the next 3 Mersenne PRP cofactors [URL="https://www.mersenne.ca/prp.php?min=50000&max=120000"]here[/URL]: M86137, M86371, and M87691.

[QUOTE=ryanp;606364]I'd also like to take the next 3 Mersenne PRP cofactors [URL="https://www.mersenne.ca/prp.php?min=50000&max=120000"]here[/URL]: M86137, M86371, and M87691.[/QUOTE]

Please don't take M86137 -- I have nearing the end of a Primo run of it.

[QUOTE=paulunderwood;606373]Please don't take M86137 -- I have nearing the end of a Primo run on it.[/QUOTE]

Oops, OK. Anyone working on the other two?

[QUOTE=ryanp;606374]Oops, OK. Anyone working on the other two?[/QUOTE]

Nope. They're yours.

[QUOTE=paulunderwood;606330]On [url]https://primes.utm.edu/primes/status.php[/url] I see Serge uses "CM" and an "x" code. UTM does not accept certs.

To be more explicit: create an x prover code attributing you and CM. When you submit the number append it with: Mersenne cofactor, ECPP[/QUOTE]

It looks as though Prof. Chris Caldwell has now created an [URL="https://primes.utm.edu/bios/page.php?id=5485"]"E" prover code[/URL], which should be selectable to create a code in order to submit CM (FastECPP) proven numbers.

Reservation: I will do a few more primU(), primV(), primeA() and primB()'s.

For those who don't know what these are, you are not missing anything.

[QUOTE=paulunderwood;606277]Nearly finished:

M86137 cofactor prp25896

Dropping:

M86371 cofactor prp25984
M87691 cofactor prp26371
E(11848)/(5*1582043) prp40792

Reserving:

R86453[/QUOTE]

I am dropping R86453. It took my machine ~12 hours to reach "Step [0]". If a step gets stuck then the time involved to run say one core to get a different proof path is infeasible. Basically the job is way too big without some very big iron.

Reserving E(11848)/(5*1582043) prp40792 again. I expect this number to take a couple of months.

[QUOTE=sweety439;606293]
Suggest you to prove (18^25667-1)/17 = R25667(18), this prime is also a generalized repunit, and is much smaller than R49081, this prime is interesting (much more interesting than R86453, you think R86453 is interesting is only because we use the number 10 as the base (radix) of our positional numeral system) is because this prime is the smallest generalized repunit prime in base 18 apart from 19 = R2(18), see [URL="https://oeis.org/A128164"]https://oeis.org/A128164[/URL][/QUOTE]

I am reserving this number, (18^25667-1)/17.

My run of the Euler Irregular "got stuck" on Step [60] and I am manually backtracking from Step [58].

Hello,


[QUOTE=paulunderwood;606326]@ryanp and @Andreas. Please make a The Prime Pages database entry for your numbers.
[/QUOTE]


the prime has an entry here now:
[URL]https://primes.utm.edu/primes/page.php?id=134003[/URL]
under the proof code E3.


Andreas

M86371 is nearing completion. W117239 i.e. [$](2^{117239}+1)/3[/$] had gotten stuck, but I will try to resume it after.

[QUOTE=ryanp;607456]M86371 is nearing completion. W117239 i.e. [$](2^{117239}+1)/3[/$] had gotten stuck, but I will try to resume it after.[/QUOTE]

I have had a 40k digit number stick twice. The second time, deleting the last two sets of numbers from ".cert1" did not work with "-np 4" -- it followed the same path. I had to delete 2 more sets and now it has chosen a new path, I think. Either that or it is actually on the same path as before and I have to be more patient. I just checked: It is now on a new path. :smile:

I will run a smallish [STRIKE]Phi(36547,-10)[/STRIKE]. It is [URL="https://mersenneforum.org/showpost.php?p=515872&postcount=90"]a Unique number[/URL].

[B]Done as of 6/19/2022.[/B]

M86371 cofactor is now proven; cert uploaded to FactorDB and [URL="http://factordb.com/certoverview.php?pending=true"]processing[/URL].

[QUOTE=ryanp;607755]M86371 cofactor is now proven; cert uploaded to FactorDB and [URL="http://factordb.com/certoverview.php?pending=true"]processing[/URL].[/QUOTE]

Please don't forget a UTM submission appending your number with Mersenne cofactor, ECPP.

@Greg The number 2^99069+99069^2 can be submitted to UTM too with the appendage ECPP.

[QUOTE=paulunderwood;607757]Please don't forget a UTM submission appending your number with Mersenne cofactor, ECPP.[/QUOTE]

[URL="https://primes.utm.edu/primes/page.php?id=134046"]Done[/URL].

[QUOTE=ryanp;607759][URL="https://primes.utm.edu/primes/page.php?id=134046"]Done[/URL].[/QUOTE]

@Ryan please add a comment to your submission.

I have just completed [URL="https://primes.utm.edu/primes/page.php?id=134055"](18^25667-1)/17[/URL]. Sweet, eh?

Congrats to Andreas for [URL="http://factordb.com/index.php?id=1100000000213078448"]10^40000+14253[/URL]. @Andreas, please make an UTM submission.

[QUOTE=paulunderwood;607870]I have just completed [URL="https://primes.utm.edu/primes/page.php?id=134055"](18^25667-1)/17[/URL]. Sweet, eh?[/QUOTE]

Well, you have not uploaded its certificate to factordb.

[QUOTE=sweety439;607872]Well, you have not uploaded its certificate to factordb.[/QUOTE]

Had a technical problem. Had to change the prefix to "$" for the candidate in the certificate file. All done. Now processing at factorDB. :smile:

[QUOTE=paulunderwood;607874]Had a technical problem. Had to change the prefix to "$" for the candidate in the certificate file. All done. Now processing at factorDB. :smile:[/QUOTE]

A quick fix for that in the source code is in [C]file.c[/C], in the [C]mpz_out_hex[/C] function.

Replace the [C]"0x"[/C] with [C]"$"[/C] and [C]"-0x"[/C] with [C]"-$"[/C]. Pretty handy if one is checking lots of small numbers.

[QUOTE=paulunderwood;607870]I have just completed [URL="https://primes.utm.edu/primes/page.php?id=134055"](18^25667-1)/17[/URL]. Sweet, eh?[/QUOTE]

You can write comments for OEIS sequences [URL="https://oeis.org/A133857"]A133857[/URL] and [URL="https://oeis.org/A128164"]A128164[/URL]

[QUOTE=Luminescence;607876]A quick fix for that ...[/QUOTE]
Or use
[CODE]sed 's/N=0x/N=$/g' cert.primo > cert.primo.out[/CODE]

[QUOTE=sweety439;607877]You can write comments for OEIS sequences [URL="https://oeis.org/A133857"]A133857[/URL] and [URL="https://oeis.org/A128164"]A128164[/URL][/QUOTE]

Can you, please? I would not know where to start.

[QUOTE=paulunderwood;607879]Can you, please? I would not know where to start.[/QUOTE]

[URL="https://oeis.org/wiki/Special:RequestAccount"]Create an OEIS account[/URL], you need account to edit sequences.

[QUOTE=sweety439;607881][URL="https://oeis.org/wiki/Special:RequestAccount"]Create an OEIS account[/URL], you need account to edit sequences.[/QUOTE]

I find "ownership" of this number by way of certification overwhelming. Would I have to tell Henri and Renaud to de-list it from their PRP database too? I don't have the inclination for all this. Please sort the OIES for me, if the sequence matters to you. You suggested this number to me. I suggest you do something about it.

[What about MathWorld?? and Wiki and...]

[QUOTE=paulunderwood;607882]I find "ownership" of this number by way of certification overwhelming. Would I have to tell Henri and Renaud to de-list it from their PRP database too? I don't have the inclination for all this. Please sort the OIES for me, if the sequence matters to you. You suggested this number to me. I suggest you do something about it.

[What about MathWorld?? and Wiki and...][/QUOTE]

No, see [URL="http://www.primenumbers.net/prptop/searchform.php?form=%282%5E83339%2B1%29%2F3&action=Search"]this proven prime[/URL] in the PRP database

[QUOTE=paulunderwood;607882]I find "ownership" of this number by way of certification overwhelming. Would I have to tell Henri and Renaud to de-list it from their PRP database too? I don't have the inclination for all this. Please sort the OIES for me, if the sequence matters to you. You suggested this number to me. I suggest you do something about it.

[What about MathWorld?? and Wiki and...][/QUOTE]

Exactly.

I feel provers should upload the cert to factordb.com and update the T5K site. Other sites beyond that can be updated later.

Reserving [URL="https://www.mersenne.ca/exponent/130439"]M130439 cofactor[/URL].

The Euler 40k number is very stuck. I am going to run just ecpp for a few weeks, and need some other number to keep the cores busy.

[QUOTE=paulunderwood;607966]Reserving [URL="https://www.mersenne.ca/exponent/130439"]M130439 cofactor[/URL].
, and need some other number to keep the cores busy.[/QUOTE]


Hello Paul, my suggestion for you.


10^19999+110949 , the smallest 20000 digit PRP
10^19999+1514722609+d,d=0,2 the smallest 20000 digit TWIN PRP


(Maybe for the 2271 digit AP-8 time saving) :smile:



Norman

[QUOTE=Cybertronic;607967]Hello Paul, my suggestion for you.


10^19999+110949 , the smallest 20000 digit PRP
10^19999+1514722609+d,d=0,2 the smallest 20000 digit TWIN PRP


(Maybe for the 2271 digit AP-8 time saving) :smile:



Norman[/QUOTE]

I will line those three 20k numbers up for after the Mersenne cofactor has been completed. You should be able to do them if you have a couple of half decent computers in a timely manner. CM is pretty fast.

[QUOTE=Cybertronic;607967]
10^19999+110949 , the smallest 20000 digit PRP
10^19999+1514722609+d,d=0,2 the smallest 20000 digit TWIN PRP
[/QUOTE]

I'll do these now!

The M130439 cofactor seems stuck. I am releasing it.

[QUOTE=paulunderwood;607982]I'll do these now!

The M130439 cofactor seems stuck. I am releasing it.[/QUOTE]


Thank you Paul ! :tu::fusion:

Can someone please update [url]https://en.wikipedia.org/wiki/Elliptic_curve_primality#Elliptic_curve_primality_proving[/url] with Andreas Enge's [URL="https://primes.utm.edu/primes/page.php?id=134003"]10^50000+65859[/URL] certification. My IP address is blocked from doing so.

It seems like somebody did that already.

Ramanujantau in PrimePages
 

Hello,


I have certified ramanujantau(47^4176) and try to submit it to the PrimePages. Does anyone know how to code it? I tried the html format indicated by [URL]https://primes.utm.edu/primes/page.php?id=120374[/URL], and also "tau (47^4176)" and "ramanujantau(47^4176)", but none of them worked.


Andreas

[QUOTE=andreas;608280]Hello,


I have certified ramanujantau(47^4176) and try to submit it to the PrimePages. Does anyone know how to code it? I tried the html format indicated by [URL]https://primes.utm.edu/primes/page.php?id=120374[/URL], and also "tau (47^4176)" and "ramanujantau(47^4176)", but none of them worked.


Andreas[/QUOTE]

It's a bit involved. I think you have enter the whole number as a "blob" and give it the label: "tau(47^4176)". However if it does not have more than 26,709 digits as of today it is inadmissible to the [URL="https://primes.utm.edu/top20/page.php?id=27"]top20 ECPP proofs[/URL].

[QUOTE=paulunderwood;608295]if it does not have more than 26,709 digits as of today it is inadmissible to the [URL="https://primes.utm.edu/top20/page.php?id=27"]top20 ECPP proofs[/URL].[/QUOTE]
It's comfortably above that. [url]http://factordb.com/index.php?id=1100000003605931235[/url]

But it's quite remarkable how quickly that lower limit is rising since Andreas released this new ECPP implementation!

Thanks for the explanation! Indeed it can be entered on the second submission page [URL]https://primes.utm.edu/primes/submit_full.php[/URL]. Adding the ECPP comment was not straightforward, I hope I did it correctly - it appears on its own page [URL]https://primes.utm.edu/primes/page.php?id=134074[/URL] now, but not (yet?) in the list of 20 largest ECPP primes.

[QUOTE=andreas;608323]Thanks for the explanation! Indeed it can be entered on the second submission page [URL]https://primes.utm.edu/primes/submit_full.php[/URL]. Adding the ECPP comment was not straightforward, I hope I did it correctly - it appears on its own page [URL]https://primes.utm.edu/primes/page.php?id=134074[/URL] now, but not (yet?) in the list of 20 largest ECPP primes.[/QUOTE]

The database re-ranks primes every 30 mins.

[QUOTE=paulunderwood;608324]The database re-ranks primes every 30 mins.[/QUOTE]

It is ranked now. Try adding a comment.

The [URL="https://primes.utm.edu/top20/page.php?id=23"]top Generalized Lucas Number[/URL] is U(24, - 25, 43201), which is equal to (25^43201+1)/26, but it is still "PRP" in [URL="http://factordb.com/index.php?id=1100000000434269528"]factordb[/URL] and no Primo certificate in factordb, and [URL="https://primes.utm.edu/primes/page.php?id=130933"]its top5000 page[/URL] says "CHG with N-1 factored part 27.39% with p8022, p1749 and p849 proven with Primo", so can someone update its primality certificate to factordb?

[QUOTE=sweety439;608359]The [URL="https://primes.utm.edu/top20/page.php?id=23"]top Generalized Lucas Number[/URL] is U(24, - 25, 43201), which is equal to (25^43201+1)/26, but it is still "PRP" in [URL="http://factordb.com/index.php?id=1100000000434269528"]factordb[/URL] and no Primo certificate in factordb, and [URL="https://primes.utm.edu/primes/page.php?id=130933"]its top5000 page[/URL] says "CHG with N-1 factored part 27.39% with p8022, p1749 and p849 proven with Primo", so can someone update its primality certificate to factordb?[/QUOTE]

AFAIK factorDB lacks the ability to verify both KP and CHG proofs.

[QUOTE=Batalov;607552]I will run a smallish [STRIKE]Phi(36547,-10)[/STRIKE]. It is [URL="https://mersenneforum.org/showpost.php?p=515872&postcount=90"]a Unique number[/URL].

[B]Done as of 6/19/2022.[/B][/QUOTE]

Can you also run the PRP of the form Phi(n,2)? You ran many PRP of the form Phi(n,10) and [URL="https://oeis.org/A061446"]Phi(n,alpha)[/URL] (alpha is a quadratic irrational number, and Phi(n,alpha) is exactly the primitive part of Fibonacci(n)).

[QUOTE=sweety439;609411]Can you also run the PRP of the form Phi(n,2)? You ran many PRP of the form Phi(n,10) and [URL="https://oeis.org/A061446"]Phi(n,alpha)[/URL] (alpha is a quadratic irrational number, and Phi(n,alpha) is exactly the primitive part of Fibonacci(n)).[/QUOTE]
I can run and I [I]have [/I]run anything I wanted.
What about you?

You want something? Run it!

[B][COLOR="Red"]Fair warning: [/COLOR][/B]one more time we will hear "But I... But I... Win$ows doesn't work! There is no binary!" - you will receive an educational ban for 7 days. Then for 30 days, then for a year. It's better that you reply nothing (that's what we advise), than one more time on top of dozens that you have already done: "Run this for me!" [B][COLOR="Red"][/Warning][/COLOR][/B]

[QUOTE=sweety439;609411]Can you also run ....[/QUOTE]

[CODE]10 install WSL2
20 IF NOT installed(WSL2) THEN GOTO 10[/CODE]

more candidates
 

Here are 5+ more possible numbers for proving....


Thread: Five or Bust
[url]https://www.mersenneforum.org/showpost.php?p=145066&postcount=1[/url]

[QUOTE=Cybertronic;610664]Here are 5+ more possible numbers for proving....


Thread: Five or Bust
[url]https://www.mersenneforum.org/showpost.php?p=145066&postcount=1[/url][/QUOTE]

You want to prove the numbers in this list up to what number? 2^176177+60947?

[QUOTE=sweety439;610667]You want to prove the numbers in this list up to what number? 2^176177+60947?[/QUOTE]


Hi sweety439,
this was not a request from me to other people. It was only a memory.
BTW, 1st I have not the equipment to prove such numbers, 2nd we have a catastrophic energy situation here in europe...
I mean, in next months it is not sure to continue a normal life...

best

[QUOTE]BTW, 1st I have not the equipment to prove such numbers, 2nd we have a catastrophic energy situation here in europe...[/QUOTE]Very true, my contract was up for renewal and shot up to 36 c/kWh... A 200 W computer is now 50€/month just in electricity.

Fortunately for some reason the dedicated server I use (located in Frankfurt) didn't get more expensive and I hope it stays that way. It might be worth looking into it, considering the cost of hardware, it's not much more expensive than running your own hardware at home now. Unless you happen to have solar power.