20160228, 16:15  #298 
"Rashid Naimi"
Oct 2015
Remote to Here/There
2^{2}·487 Posts 
Hi,
Finally had some time to setup a new hard disk, install 64 bit ubuntu and Primo 4.1.1. My first certified Prime has 4351dd: http://factordb.com/index.php?id=1100000000824783248 Question: * How do you determine the optimum SieveBit parameter? http://www.ellipsa.eu/public/primo/primo.html#Timings Thank you in advance 
20160417, 18:34  #299 
Sep 2009
2^{2}×487 Posts 
Another pair where proving the smaller http://factorization.ath.cx/index.ph...00000832912748 will enable a N1 proof for the larger http://factorization.ath.cx/index.ph...00000832685935 ((34^2511)^22)/23
The smaller was created when I added the algebraic factors of ((34^2511)^22)/231 since that's ((34^2511)^225)/23 so splits into (34^2516)(34^251+4). Chris 
20160423, 18:34  #300 
Sep 2009
2^{2}×487 Posts 
Thanks to whoever proved the last pair.
And here's another pair. Proving http://factorization.ath.cx/index.ph...00000836244837 (386 digits) will enable a N1 proof for (23369^2831)/23368, http://factorization.ath.cx/index.ph...00000835634181 (1232 digits). Chris Last fiddled with by chris2be8 on 20160423 at 18:48 Reason: Spelling 
20160423, 18:47  #301 
Sep 2009
11110011100_{2} Posts 
And another, proving http://factorization.ath.cx/index.ph...00000836244978 (401) digits will enable a N1 proof for (26437^2831)/26436, http://factorization.ath.cx/index.ph...00000835634435 (1248 digits).
Chris 
20160424, 10:24  #302 
Sep 2009
79C_{16} Posts 
And another.
Proving http://factorization.ath.cx/index.ph...514&open=prime (520 digits) prime will enable a N1 proof for (24767^3731)/24766 http://factorization.ath.cx/index.ph...00000835636422 (1635 digits). Chris 
20160424, 13:34  #303 
Sep 2009
1948_{10} Posts 
And again.
Proving http://factorization.ath.cx/index.ph...00000836283883 (594 digits) will enable a N1 proof for (13901^4391)/13900 http://factorization.ath.cx/index.ph...00000835637312 (1815 digits). Chris 
20160424, 19:26  #304 
Sep 2009
2^{2}×487 Posts 
And another pair.
Proving http://factorization.ath.cx/index.ph...00000836303593 (628 digits) will enable a N1 proof for (22853^4571)/22852 http://factorization.ath.cx/index.ph...00000835639140 (1988 digits). Chris 
20160424, 19:36  #305  
Oct 2015
104_{8} Posts 
Quote:


20160424, 20:09  #306 
Sep 2009
2^{2}×487 Posts 
And again...
Proving http://factorization.ath.cx/index.ph...00000836304391 (503 digits) will enable a N1 proof that (22943^4631)/22942 http://factorization.ath.cx/index.ph...00000835639239 (2015 digits) is prime. Chris 
20160429, 13:19  #307  
Nov 2012
2^{3}×3^{2} Posts 
Quote:


20160429, 15:32  #308 
Sep 2009
2^{2}×487 Posts 
That's odd. http://factorization.ath.cx/index.ph...312&open=prime now says it's proven by N1. I've sometimes seen factordb take a little while to recognize updates, that might have happened here.
Thanks for proving all the smaller ones anyway. Chris 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Can two Mersenne numbers share a factor?  James Heinrich  Math  57  20110912 14:16 
Avoidance of self & otherdeception in proofs  cheesehead  Soap Box  71  20100114 09:04 
Curious and want to share about Prime number 23  spkarra  PrimeNet  4  20091120 03:54 
Status of GIMPS proofs  BrianE  Information & Answers  7  20070802 23:15 
Collection of Proofs?  Orgasmic Troll  Math  1  20041230 15:10 