mersenneforum.org New repunit (PRP) primes found, 5794777 and 8177207 decimal digits (PRP records)
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2021-04-20, 21:28 #1 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 3×5×641 Posts New repunit (PRP) primes found, 5794777 and 8177207 decimal digits (PRP records) The last two known repunits were found back in 2007. Welcome, the year 2021. With Ryan Propper, we decided to give a boost to the project which changed a few homes over the years. (We don't know the latest live site. skoberne site is defunct. Perhaps, Kurt's subpage.) So, we might go up to p<10,000,000 and so far found one. We are using MT llr and gr-mfaktc to 64 bits for presieve. It is submitted to PRPtop, to Mathworld and to UTM (in category of thesaurus of primes). Wikipedia and OEIS 004023 will be updated when sourced with other pages. It is R5794777, and perhaps unsurprisingly it has 5794777 decimal digits (all "1"s). It also happens to be the largest currently known PRP.
2021-04-20, 22:07   #2
paulunderwood

Sep 2002
Database er0rr

75368 Posts

Quote:
 Originally Posted by Batalov R5794777
That is one hell of a PRP. Congrats on such a large find.

 2021-04-20, 23:01 #3 Jeff Gilchrist     Jun 2003 Ottawa, Canada 3×17×23 Posts Nice, congrats.
 2021-04-21, 00:41 #4 Dr Sardonicus     Feb 2017 Nowhere 23·223 Posts Wow, heck of a find! Not a whole lot of more-than-million-decimal-digit PRPs known. Hmm. OEIS lists Rp exponents as 2, 19, 23, 317, 1031, 49081, 86453, 109297, 270343, ... and gives 2007 for last two. It seems that 1031 is the largest exponent for which primality is actually proved So, have all primes 270343 < p < 5794777 been ruled out as exponents for decimal repunit primes? That too would be a heck of an achievement.
 2021-04-21, 01:12 #5 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 258F16 Posts Kurt's site ascertains that region below 4300447 is finished. We have not double-checked that region. We will check all eligible candidates in range 4,300,447 < p < 10,000,000 (or maybe less, -- whatever resources will allow).
2021-04-21, 02:26   #6
axn

Jun 2003

3·11·157 Posts

Quote:
 Originally Posted by Batalov We are using MT llr and gr-mfaktc to 64 bits for presieve.
How does LLR performance compare with P95/mprime on this type? Do you have any data?

2021-04-21, 03:00   #7
T.Rex

Feb 2004
France

39A16 Posts

Quote:
 Originally Posted by Batalov . It is R5794777, and perhaps unsurprisingly it has 5794777 decimal digits (all "1"s).
Wowww So Big. Congratulations!

2021-04-21, 05:35   #8
Batalov

"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

961510 Posts

Quote:
 Originally Posted by axn How does LLR performance compare with P95/mprime on this type? Do you have any data?
It is almost the same, but operationally speaking, running single jobs is cleaner with LLR2. (Prime95 stays running forever after worktodo.txt is spent/empty, and needs to be killed, or source tampered with and recompiled - but that would only converge its evolution into a clone of LLR). Ryan prefers LLR. Currently using sllr from Jean's site. (Also trying the one with 30.6 gwnum as the engine, off-line, as a test.)

LLR does the Prime95 computational trick since a few releases back - i.e. PRP-tests the (k*b^n+c)/e form using (k*b^n+c) transform, nor a general transform. With monic (k=1), c=-1, it is of course ridiculously fast compared to general form, -- theoretically as fast as testing Mersennes of the same size.

 2021-04-21, 07:16 #9 JeppeSN     "Jeppe" Jan 2016 Denmark 52·7 Posts Good one! Maybe it will be clear when the PRP Top entry becomes visible, but what types of PRP tests has this one "passed", as of now? /JeppeSN
2021-04-21, 08:08   #10
axn

Jun 2003

3·11·157 Posts

Quote:
 Originally Posted by Batalov It is almost the same, but operationally speaking, running single jobs is cleaner with LLR2. (Prime95 stays running forever after worktodo.txt is spent/empty, and needs to be killed, or source tampered with and recompiled - but that would only converge its evolution into a clone of LLR). Ryan prefers LLR. Currently trying the one with 30.6 gwnum as the engine. LLR does the Prime95 computational trick since a few releases back - i.e. PRP-tests the (k*b^n+c)/e form using (k*b^n+c) transform, nor a general transform. With monic (k=1), c=-1, it is of course ridiculously fast compared to general form, -- theoretically as fast as testing Mersennes of the same size.
Cool.

BTW, mprime does have the ability to exit when out of work (conveniently called ExitWhenOutOfWork). Not sure if that was done for other platforms as well.

2021-04-21, 14:48   #11
Dr Sardonicus

Feb 2017
Nowhere

23×223 Posts

Quote:
 Originally Posted by Batalov Kurt's site ascertains that region below 4300447 is finished. We have not double-checked that region. We will check all eligible candidates in range 4,300,447 < p < 10,000,000 (or maybe less, -- whatever resources will allow).
If you click on an interval in the Details section on the page you link to, you get all the results - factors or PRP test residues.

It appears that there's a typo on the line with the big announcement:

10ˆ600000 . . . . . . R5794777 = PRP . . . . . . S. Batalov - Ryan Propper (Apr 2021)

I believe the exponent should be 6000000 rather than 600000.

 Similar Threads Thread Thread Starter Forum Replies Last Post Bob Underwood Math 12 2020-10-11 20:01 EdH CADO-NFS 127 2020-10-07 01:47 enzocreti enzocreti 1 2020-03-03 18:38 tuckerkao Miscellaneous Math 2 2020-02-16 06:23 3.14159 Information & Answers 8 2018-12-09 00:08

All times are UTC. The time now is 21:58.

Wed Dec 1 21:58:16 UTC 2021 up 131 days, 16:27, 1 user, load averages: 1.66, 1.48, 1.35