mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > FactorDB

Reply
 
Thread Tools
Old 2022-05-16, 21:54   #441
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

72×73 Posts
Default

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.
sweety439 is offline   Reply With Quote
Old 2022-06-17, 16:46   #442
MDaniello
 
MDaniello's Avatar
 
May 2019
Rome, Italy

4210 Posts
Default

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
In addition to these, several Carol-Kynea primes that lacked any kind of primality proof.
Some other primes of this kind were missing from the db at all.
MDaniello is offline   Reply With Quote
Old 2022-07-14, 06:36   #443
MDaniello
 
MDaniello's Avatar
 
May 2019
Rome, Italy

2×3×7 Posts
Default

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
MDaniello is offline   Reply With Quote
Old 2022-07-14, 07:42   #444
sweety439
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

357710 Posts
Default

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)

Quote:
Originally Posted by MDaniello View Post
In addition to these, several Carol-Kynea primes that lacked any kind of primality proof.
Some other primes of this kind were missing from the db at all.
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
sweety439 is offline   Reply With Quote
Old 2022-07-28, 16:13   #445
chris2be8
 
chris2be8's Avatar
 
Sep 2009

26·37 Posts
Default

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.
chris2be8 is offline   Reply With Quote
Old 2022-08-09, 15:51   #446
chris2be8
 
chris2be8's Avatar
 
Sep 2009

1001010000002 Posts
Default

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.
chris2be8 is offline   Reply With Quote
Old 2022-08-10, 15:33   #447
chris2be8
 
chris2be8's Avatar
 
Sep 2009

94016 Posts
Default

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
chris2be8 is offline   Reply With Quote
Reply

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

All times are UTC. The time now is 01:07.


Tue Aug 16 01:07:42 UTC 2022 up 39 days, 19:55, 1 user, load averages: 1.72, 1.52, 1.35

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔