![]() |
![]() |
#1 |
"Serge"
Mar 2008
San Diego, Calif.
2·3·1,733 Posts |
![]()
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. |
![]() |
![]() |
![]() |
#2 |
Sep 2002
Database er0rr
3·1,601 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
Jun 2003
Ottawa, Canada
3·17·23 Posts |
![]()
Nice, congrats.
|
![]() |
![]() |
![]() |
#4 |
Feb 2017
Nowhere
22×32×181 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. |
![]() |
![]() |
![]() |
#5 |
"Serge"
Mar 2008
San Diego, Calif.
2×3×1,733 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). |
![]() |
![]() |
![]() |
#6 |
Jun 2003
10101011000102 Posts |
![]() |
![]() |
![]() |
![]() |
#7 |
Feb 2004
France
3B516 Posts |
![]() |
![]() |
![]() |
![]() |
#8 | |
"Serge"
Mar 2008
San Diego, Calif.
289E16 Posts |
![]() Quote:
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. |
|
![]() |
![]() |
![]() |
#9 |
"Jeppe"
Jan 2016
Denmark
22·72 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 |
![]() |
![]() |
![]() |
#10 | |
Jun 2003
2·7·17·23 Posts |
![]() Quote:
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. |
|
![]() |
![]() |
![]() |
#11 | |
Feb 2017
Nowhere
22·32·181 Posts |
![]() Quote:
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. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Generalized Repunit primes | Bob Underwood | Math | 12 | 2020-10-11 20:01 |
Some CADO-NFS Work At Around 175-180 Decimal Digits | EdH | CADO-NFS | 127 | 2020-10-07 01:47 |
Integers congruent to last two decimal digits mod 23 | enzocreti | enzocreti | 1 | 2020-03-03 18:38 |
Twin Primes with 128 Decimal Digits | tuckerkao | Miscellaneous Math | 2 | 2020-02-16 06:23 |
records for primes | 3.14159 | Information & Answers | 8 | 2018-12-09 00:08 |