2022-05-16, 21:54 | #441 |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
7^{2}×73 Posts |
The generalized repunit probable prime, R2731(685), N-1 has 31.345% factored, all algebraic factors are already entered.
Factoring this 167 digit number (a factor of Phi(390,685), i.e. a factor of 685,195+) will enable N-1 proof for R2731(685), since this will make N-1 have >33.333% factored. |
2022-06-17, 16:46 | #442 |
May 2019
Rome, Italy
44_{10} Posts |
Code:
2684720974...01 N+/-1 350 digits 5548042917...01 N+/-1 497 digits (86^294+2)/6 N-1 598 digits (19607^353+1)/19608 N-1 1511 digits 4687274111...01 N-1 1381 digits (13088^373-1)/13087 N-1 1532 digits (17200^457+1)/17201 N-1 1932 digits (5183^521+1)/5184 N-1 1932 digits (17195^457-1)/17194 N-1 1932 digits Some other primes of this kind were missing from the db at all. |
2022-07-14, 06:36 | #443 |
May 2019
Rome, Italy
2^{2}×11 Posts |
Code:
(65540^101-1)/65539 N-1 482 digits (65656^109-1)/65655 N-1 521 digits (65560^113-1)/65559 N-1 540 digits (65638^113-1)/65637 N-1 540 digits (65528^113-1)/65527 N-1 540 digits (20589^127-1)/20588 N-1 544 digits (20881^127-1)/20880 N-1 545 digits (20902^127-1)/20901 N-1 545 digits (65592^127-1)/65591 N-1 607 digits 80513^544-2 N+1 2669 digits (1858^919+1)/1859 N-1 3001 digits |
2022-07-14, 07:42 | #444 |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
7^{2}×73 Posts |
Many of these numbers (not including numbers of the form k*b^n+1 and k*b^n-1, since N-1 or N+1 are trivially 100% factored) are of these forms:
(b^n-1)/(b-1) (use N-1) (n must be prime) (b^n+1)/(b+1) (use N-1) (n must be prime) (b^(2^n)+1)/2 (use N-1) (b is odd) b^n+2 (use N-1) b^n-2 (use N+1) b^n+(b-1) (use N+1) b^n-(b-1) (use N-1) b^n+(b+1) (use N-1) b^n-(b+1) (use N+1) ((b-2)*b^n+1)/(b-1) (use N-1) For these numbers, factor N-1 or N+1 is equivalent to factor the Cunningham number b^n+-1 (or b^(n-1)+-1), and the smallest primes of these forms are minimal "prime > base" in base b (this is an interesting problem, there are 77 such primes in decimal (base 10), and they are 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027) For the Carol primes (b^n-1)^2-2 and Kynea primes (b^n+1)^2-2, N-1 is trivially 50% factored Last fiddled with by sweety439 on 2022-07-14 at 07:53 |
2022-07-28, 16:13 | #445 |
Sep 2009
4532_{8} Posts |
Is anyone on mersenneforum generating Primo certs for numbers around 964 digits? I'm running a script to prove small PRPs, working from 300 digits upwards, and I've noticed a lot of numbers where someone else proved them just before my script was about to prove them. So we could easily waste effort by working on the same numbers.
I've seen a few by kotenok2000 around 763 digits. But the latest batch were anonymous. Moving to 980 digits would avoid collisions for a few weeks. Or better keep an eye on http://factordb.com/stat_1.php?prp and avoid the first few hundred numbers it shows. I've got another system working from 1000 digits upwards, So please also avoid the first few hundred numbers over 1000 digits. |
2022-08-09, 15:51 | #446 |
Sep 2009
2·3^{2}·7·19 Posts |
factordb seems to have stopped accepting new primo certificates. If I submit a certificate the response says "Saved certificate for processing.." but when I look at the number it still shows as PRP and does not say it has a certificate being processed. So the certificate seems to have vanished.
I've had to stop my script to prove small PRPs, it was trying to prove the same numbers repeatedly. |
2022-08-10, 15:33 | #447 |
Sep 2009
95A_{16} Posts |
Markus has replied to an email I sent, there was a bug in certificate processing. It's now fixed, but certificates submitted since Monday 8 August will need to be re-submitted.
So I've re-started my scripts to prove smallish PRPs. Last fiddled with by chris2be8 on 2022-08-10 at 16:13 Reason: typo |
2022-09-06, 19:06 | #448 |
May 2019
Rome, Italy
2^{2}×11 Posts |
Code:
8333145585...01 N+/-1 400 digits (65555^101-1)/65554 N-1 482 digits ((71+F81)^32+1)/2 N-1 531 digits 4468174714...71 N-1 570 digits (9029^168+2)/3 N-1 665 digits (50^414+2)/66 N-1 702 digits (9031^178+2)/3 N-1 704 digits 1389101724...41 N-1 1513 digits 87011^546-2 N+1 2698 digits 67211^600-2 N+1 2897 digits 80363^594-2 N+1 2914 digits 95461^600-2 N+1 2988 digits 39827^654-2 N+1 3009 digits 80761^614-2 N+1 3014 digits (7814^1213-1)/7813 N-1 4719 digits |
2022-09-27, 16:25 | #449 |
May 2019
Rome, Italy
2^{2}×11 Posts |
Code:
2^1656+1-2^1035-2^621-2^207 N-1 499 digits 2^1973*3892729+2^987*1973+1 N-1 601 digits (11281^206+1)/127260962 N-1 827 digits 2^3337*11135569+2^1669*3337+1 N-1 1012 digits 10^380*380!/10-1 N+1 1196 digits (20150^331-1)/20149 N-1 1421 digits 77711^586-2 N+1 2866 digits 85369^660-2 N+1 3255 digits (8602^1021-1)/8601-2 N+1 4014 digits (8602^1021-1)/8601 N-1 4014 digits |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Can two Mersenne numbers share a factor? | James Heinrich | Math | 57 | 2011-09-12 14:16 |
Avoidance of self- & other-deception in proofs | cheesehead | Soap Box | 71 | 2010-01-14 09:04 |
Curious and want to share about Prime number 23 | spkarra | PrimeNet | 4 | 2009-11-20 03:54 |
Status of GIMPS proofs | Brian-E | Information & Answers | 7 | 2007-08-02 23:15 |
Collection of Proofs? | Orgasmic Troll | Math | 1 | 2004-12-30 15:10 |