mersenneforum.org (https://www.mersenneforum.org/index.php)
-   And now for something completely different (https://www.mersenneforum.org/forumdisplay.php?f=119)
-   -   Primo reservation thread (https://www.mersenneforum.org/showthread.php?t=24525)

 Batalov 2020-11-02 02:37

[QUOTE=Gelly;561841]... the [B]Unique Primes[/B] list, so I'll be proving Phi(79710,10) (PRP21248)[/QUOTE]

[QUOTE=sweety439;561890]There is a much smaller PRP factor of ...[/QUOTE]
...and is it a unique number?

 VBCurtis 2020-11-02 06:54

[QUOTE=Batalov;561902]...and is it a unique number?[/QUOTE]

Sweety doesn't let knowledge or relevance get in the way of telling people what to do with their time. Shame, really.

 Dr Sardonicus 2020-11-02 13:49

[QUOTE=Batalov;561902][QUOTE=Gelly;561841]... the [B]Unique Primes[/B] list, so I'll be proving Phi(79710,10) (PRP21248)[/QUOTE]

[QUOTE=sweety439;561890]There is a much smaller PRP factor of ...[/QUOTE]...and is it a unique number?[/QUOTE]
No. This is easily inferred from the latter post. The factor in the denominator is obviously larger than (10[sup]7[/sup] - 1)/9. We find that

$$\Phi_{6881}(10)\text{ has the prime factors 13763 and 3213467855281944242613907639214901656160438225853}$$

in addition to the PRP cofactor. The decimal expansions of the reciprocals of these two primes have period 6881.

 paulunderwood 2020-11-02 15:58

[QUOTE=sweety439;561890]There is a much smaller PRP factor of Phi(n,10), (10^6881-1)/(10^983-1)/49141059632832877096172610809992897380296624365337454176129, see [URL="https://stdkmd.net/nrr/repunit/prpfactors.htm"]https://stdkmd.net/nrr/repunit/prpfactors.htm[/URL][/QUOTE]

For one who is obsessed with all things small, why don't you do it yourself? If you have Win10 you can install Linux in WSL and run Primo. What is your excuse? :ermm:

 Gelly 2020-11-23 22:11

[QUOTE=Gelly;561841]Someone mentioned to me another list that is outdated in terms of compute power is the Unique Primes list, so I'll be proving Phi(79710,10) (PRP21248)[/QUOTE]

Done! Took longer than it should have, as I'm running double duty on a bunch of silly projects with too few computers, but it's done. As an added bonus, this one managed to get onto FactorDB, so no need to rely on having it be a top 20 Primo result for proof!

Next project is a PRP22234 (thanks, Thomas Ritschel!), which will be the largest proven irregular prime by a wide margin once it's done.

 paulunderwood 2020-12-25 02:11

I am 5.5 months into certifying R49081. Expect the result in August or September 2021 assuming all goes well. :xmastree:

 Batalov 2020-12-25 04:46

I am [STRIKE]nearly[/STRIKE] done with a 'small' Euler irregular ([URL="https://primes.utm.edu/primes/page.php?id=131505"]21k digits[/URL]) and working on a new Bern irregular (26k digits).

 Gelly 2021-01-03 05:55

[QUOTE=Gelly;564141]
Next project is a PRP22234 (thanks, Thomas Ritschel!), which will be the largest proven irregular prime by a wide margin once it's done.[/QUOTE]

Got the wrong one. I evidently don't understand how to order candidates in Primo right, so instead I proved 798*Bern(8766)/(487*4657*6468702182951641) (23743 digits).

Currently being verified by FactorDB and will post with a new proof code soon enough. It beats the old record by almost 10k digits and it was an accident. Figures, haha.

Next is the actual PRP I meant to work on, which didn't actually list the candidate, defeating the purpose of the "primo reservation" bit. The PRP is 348054*Bern(8286)/(103*409*1381*123997*217757687456069039) (22234 digits).

[QUOTE=paulunderwood;567283]I am 5.5 months into certifying R49081. Expect the result in August or September 2021 assuming all goes well. :xmastree:[/QUOTE]

I'm extremely excited to hear about how fast that is, considering how large the candidate is! I may have to splurge on a 3990x myself, assuming that's your current machine, or just wait until the next major development in thread technology or whatever.

[QUOTE=Batalov;567286]I am [STRIKE]nearly[/STRIKE] done with a 'small' Euler irregular ([URL="https://primes.utm.edu/primes/page.php?id=131505"]21k digits[/URL]) and working on a new Bern irregular (26k digits).[/QUOTE]

Beans. Looks like my Bern irregular record will be terribly ephemeral. Nice work!

 Batalov 2021-01-03 06:30

1 Attachment(s)
Summarizing:[LIST][*]798*Bern(8766)/(487*4657*6468702182951641) ([URL="http://factordb.com/index.php?id=1100000002364864121"]23743 digits[/URL]) Done[*]348054*Bern(8286)/(103*409*1381*123997*217757687456069039) ([URL="http://factordb.com/index.php?id=1100000002228018702"]22234 digits[/URL]) Reserved; in progress ?[*]numerator(Bern(9702)) cofactor ([URL="http://factordb.com/index.php?id=1100000002198594541"]26709 digits[/URL]) Reserved; 60% done[/LIST]
Re: order: the candidates will be done in the order in which you shift-clicked. If you select/drag a range of numbers, then primo will "decide itself". Hint: always have the size estimates at hand and (as needed) convert them to bit-size and then quickly see that size in the Bits dialog window:

 Batalov 2021-01-03 06:45

Btw, a few people asked before, how to estimate how far are you down the path of the proof. A number of years ago, I'd splined the runtimes to "Bits" size and the power slope was not quite "4" and not quite "5". (Probably due to backtracks. If descent was ideal, then one could expect nearly "4".)
I use "4.5".

That is: if the progress in bits is (using example shown above): 70889 / 88724, then the percent remaining work is :
[CODE]? (70889 / 88724) ^ 4.5
0.36426 \\ this much remaining, approximately
? 1 - %
0.63573 \\ this much done, approximately[/CODE]

 Gelly 2021-01-03 06:52

[QUOTE=Batalov;568155][*]348054*Bern(8286)/(103*409*1381*123997*217757687456069039) ([URL="http://factordb.com/index.php?id=1100000002228018702"]22234 digits[/URL]) Reserved; in progress ?
[/QUOTE]

Yup! Using the formula you provided in the second post, it's 3.6% done.

I recall the split being between 4 and 5 being something you could determine using heuristic arguments - on Wikipedia, they give the big-O as definitely O(log(n)^(5+epsilon)), with some versions of heuristic arguments bringing it down to O(log(n)^(4+epsilon)).

Since Wikipedia is very wishy-washy about it, I would put it somewhere between those two estimates, giving what you found, 4.5.

Edit: Think you got your numbers backward - (80000/80000)^4.5 = 1, meaning 100% remaining, not 100% done. At least, when you read the number from Primo directly.

All times are UTC. The time now is 18:08.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.