![]() |
![]() |
#1 |
"Phil"
Sep 2002
Tracktown, U.S.A.
2·13·43 Posts |
![]()
This just turned up today:
[Fri Sep 30 03:16:31 2011] ECM found a factor in curve #97, stage #2 Sigma=7408035135864132, B1=3000000, B2=300000000. M524287 has a factor: 65997004087015989956123720407169 M524287 is the iterated Mersenne number M(M(19)). Will Edgington keeps the status of these numbers at: http://www.garlic.com/~wedgingt/MMPstats.txt I also verified that the cofactor by the five known prime factors is composite, and also not a prime power, using a script file and pfgw. Last fiddled with by philmoore on 2011-09-30 at 23:30 |
![]() |
![]() |
![]() |
#2 |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts |
![]()
The group order shows that this was a close find near the B1. The B1 was 3,000,000, and the penultimate factor was 2,927,861. Congratulations!
Last fiddled with by Mini-Geek on 2011-10-01 at 01:13 |
![]() |
![]() |
![]() |
#3 |
Jun 2003
116910 Posts |
![]()
PrimeNet still doesn't have it.
|
![]() |
![]() |
![]() |
#4 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2×3×1,753 Posts |
![]() Quote:
You're a better man than I, Gunga Din. I'd never seriously consider running ECM on a number of that size. How long did each curve take? Paul |
|
![]() |
![]() |
![]() |
#5 |
"Phil"
Sep 2002
Tracktown, U.S.A.
21368 Posts |
![]()
I was doing about 1.7 curves per day on each core of an old Pentium D. Slow progress, of course, but not so slow compared to the ECM work currently being done on Fermat numbers.
|
![]() |
![]() |
![]() |
#6 |
Nov 2003
164448 Posts |
![]() |
![]() |
![]() |
![]() |
#7 |
"Phil"
Sep 2002
Tracktown, U.S.A.
100010111102 Posts |
![]() |
![]() |
![]() |
![]() |
#8 |
∂2ω=0
Sep 2002
Repรบblica de California
2×3×1,931 Posts |
![]()
Very nice. I expect it won't be too long before you're running ECM on M(M(31)) - what do you estimate the stage 1 and 2 memory needs for such a computation would be?
|
![]() |
![]() |
![]() |
#9 |
Dec 2010
10010102 Posts |
![]()
Very nice find! I just noticed today when I looked at the MMPStats.txt page.
Two questions: 1. Have any of the double Mersenne numbers been completed factored? 2. What's the best software to use in order to search for factors of double Mersenne numbers? |
![]() |
![]() |
![]() |
#10 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
291616 Posts |
![]() Quote:
MM3 = 2^(2^3-1)-1 = 2^7-1 = 127 MM5 = 2^(2^5-1)-1 = 2^31-1 = 2147483647 MM7 = 2^(2^7-1)-1 = 2^127-1 = 170141183460469231731687303715884105727 All of the above are fully factored into primes, so I can safely answer the first question in the affirmative. 2. It depends. Finding factors of MM13 might still be possible with ECM and/or P-1. Factoring larger ones is likely to be the province of trial division at the moment. Paul |
|
![]() |
![]() |
![]() |
#11 |
Dec 2010
2×37 Posts |
![]()
Sorry, I meant to ask this question:
Have any of the double Mersenne *composites* been completely factored? (The first one seems to be 2^8191-1, MM13) Also, how can I use Prime95 to trial factor Mersenne numbers beyond the default stopping point? I can't seem to get Prime95 to do trial factoring of a specific Mersenne number. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Factor found that should have been found by P-1 | tha | Data | 65 | 2020-08-05 21:11 |
F12 factor found? | johnadam74 | FermatSearch | 16 | 2016-11-03 12:10 |
Small inconsistencies between mersenne.org and mersenne.ca factor databases | GP2 | mersenne.ca | 44 | 2016-06-19 19:29 |
found this factor | tha | Factoring | 4 | 2007-06-18 19:56 |
After a factor is found it keeps on going | jocelynl | Software | 6 | 2004-08-07 01:31 |