mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > FactorDB

Reply
 
Thread Tools
Old 2015-02-08, 17:01   #199
chris2be8
 
chris2be8's Avatar
 
Sep 2009

24·131 Posts
Default

Thanks to whoever did the last one, I've just found another case:

Proving http://factorization.ath.cx/index.ph...00000748602274 (((10^274+10^137+1)*(2^452-3)/3+10^411*1972-1)/53366409470) will enable a N-1 proof that http://factorization.ath.cx/index.ph...00000748438030 ((10^274+10^137+1)*(2^452-3)/3+10^411*1972) is prime.

Chris
chris2be8 is offline   Reply With Quote
Old 2015-02-16, 20:35   #200
chris2be8
 
chris2be8's Avatar
 
Sep 2009

24·131 Posts
Default

After adding algebraic factors to http://factorization.ath.cx/index.ph...00000504241133 ((6607^853-1)/6606) I found that proving http://factorization.ath.cx/index.ph...00000755048276 (a 1067 digit PRP) will probably be enough to prove it prime.

Chris
chris2be8 is offline   Reply With Quote
Old 2015-02-17, 16:10   #201
chris2be8
 
chris2be8's Avatar
 
Sep 2009

24×131 Posts
Default

Thanks for proving that.

Here's another:
Proving http://factorization.ath.cx/index.ph...00000755346596 is prime should enable a N-1 proof for http://factorization.ath.cx/index.ph...00000439186935 ((4122^937-1)/4121).

Chris
chris2be8 is offline   Reply With Quote
Old 2015-02-17, 18:26   #202
chris2be8
 
chris2be8's Avatar
 
Sep 2009

24·131 Posts
Default

And another:

Proving http://factorization.ath.cx/index.ph...00000755505371 should be enough to prove http://factorization.ath.cx/index.ph...00000512390486 ((3581^967-1)/3580) is prime.

Chris
chris2be8 is offline   Reply With Quote
Old 2015-02-19, 20:24   #203
chris2be8
 
chris2be8's Avatar
 
Sep 2009

83016 Posts
Default

And ...

Proving http://factorization.ath.cx/index.ph...00000756068010 will enable a N-1 proof for http://factorization.ath.cx/index.ph...00000439186901 ((4854^1009-1)/4853).

Chris
chris2be8 is offline   Reply With Quote
Old 2015-02-26, 21:24   #204
chris2be8
 
chris2be8's Avatar
 
Sep 2009

24·131 Posts
Default

And proving http://factorization.ath.cx/index.ph...00000759078678 should be enough to prove http://factorization.ath.cx/index.ph...00000439186888 ((4735^1153-1)/4734) is prime. The former is 452 digits and the latter is 4234 digits so it's a bigger ration than usual.

Chris
chris2be8 is offline   Reply With Quote
Old 2015-02-27, 18:14   #205
chris2be8
 
chris2be8's Avatar
 
Sep 2009

24×131 Posts
Default

Another:

Proving http://factorization.ath.cx/index.ph...00000759995166 is probably enough to prove http://factorization.ath.cx/index.ph...00000696698412 ((116^2089+1)/117) is prime.

Chris
chris2be8 is offline   Reply With Quote
Old 2015-02-27, 21:41   #206
chris2be8
 
chris2be8's Avatar
 
Sep 2009

209610 Posts
Default

And another:

Proving http://factorization.ath.cx/index.ph...00000759997087 will enable a N-1 proof that http://factorization.ath.cx/index.ph...00000296002061 (22^3217+21) is prime (at least this one is certainly large enough for the proof).

Chris
chris2be8 is offline   Reply With Quote
Old 2015-02-28, 07:08   #207
axn
 
axn's Avatar
 
Jun 2003

13DD16 Posts
Default

Quote:
Originally Posted by chris2be8 View Post
Another:

Proving http://factorization.ath.cx/index.ph...00000759995166 is probably enough to prove http://factorization.ath.cx/index.ph...00000696698412 ((116^2089+1)/117) is prime.

Chris
It wasn't. However, adding some more missing algebraic factors did the trick.
axn is offline   Reply With Quote
Old 2015-02-28, 08:53   #208
chris2be8
 
chris2be8's Avatar
 
Sep 2009

1000001100002 Posts
Default

Quote:
Originally Posted by chris2be8 View Post
Another:

Proving http://factorization.ath.cx/index.ph...00000759995166 is probably enough to prove http://factorization.ath.cx/index.ph...00000696698412 ((116^2089+1)/117) is prime.

Chris
That wasn't quite enough. So I started work on the smallest factor of N-1, (116^116+1)/5549418630282309787479951401753137, and found:
Code:
********** Factor found in step 2: 1563721650332372051297386247663898037313
Found probable prime factor of 40 digits: 1563721650332372051297386247663898037313
Probable prime cofactor 34571626573845918564783429269016198081709009231700089277835355381228515794200673865236406976328168287033463361692761363974121183975856856744607152825112929989944807057 has 167 digits
Which was enough to prove (116^2089+1)/117 is prime.

Chris

Edit. I didn't notice AXN's post before I made this one. But I added the factors above to factordb a couple of hours ago but factordb took a while to run the N-1 test.

@AXN, what algebraic factors did you add? I thought I'd added all possible ones before I asked for the smal PRP to be proved.

Edit 2: Is anyone working on the PRP in post 204?

Last fiddled with by chris2be8 on 2015-02-28 at 09:05 Reason: Noticed AXN's post.
chris2be8 is offline   Reply With Quote
Old 2015-02-28, 11:08   #209
axn
 
axn's Avatar
 
Jun 2003

32·5·113 Posts
Default

Quote:
Originally Posted by chris2be8 View Post
@AXN, what algebraic factors did you add? I thought I'd added all possible ones before I asked for the smal PRP to be proved.
Hmmm... I was just working thru the algebraic factors from bottom up and supplying factors and all of a sudden one of the top level composites got factored. So I took credit for it. Must've been the factor you submitted.
axn 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 06:20.


Fri Aug 6 06:20:08 UTC 2021 up 14 days, 49 mins, 1 user, load averages: 3.18, 2.81, 2.79

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.