mersenneforum.org M1069 factored by GMP-ECM
 Register FAQ Search Today's Posts Mark Forums Read

 2013-08-02, 15:41 #1 ryanp     Jun 2012 Boulder, CO 5×37 Posts M1069 factored by GMP-ECM Hi, Not sure if there's a better place to report this, but in case anyone is also working on M1069... Code: GMP-ECM 6.4.3 [configured with GMP 5.1.0, --enable-asm-redc] [ECM] Input number is 9655070422115390416186543323849937005579725788253857499949114359491746862455829812455134063238947823422491484330358385786011269349179010346254104507595134837566843566346678652406165295157034775190255938827595701944106198632228542317011888983903368867049017 (256 digits) Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=3725672826 Step 1 took 1891828ms Step 2 took 688319ms ********** Factor found in step 2: 5557036167944892502666285821951871600803581019193074182942021552512721 Found probable prime factor of 70 digits: 5557036167944892502666285821951871600803581019193074182942021552512721 Probable prime cofactor 1737449627880690251595720971509773434839416433962933088550256363151433564424184235036716533956588433095081958412139739283774089341095270403988232339045024984541371228013713117350142329577 has 187 digits Report your potential champion to Richard Brent (see http://wwwmaths.anu.edu.au/~brent/ftp/champs.txt)
 2013-08-02, 15:48 #2 firejuggler     Apr 2010 Over the rainbow 2×1,217 Posts can't say less than this : congratulation
 2013-08-02, 17:17 #3 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 912310 Posts Congratulations! Apart from emailing Sam and R.Brent (that you undoubtedly had done), there's the ECM records' submission form here, and the result will be immediately seen here and here
 2013-08-02, 18:05 #4 Batalov     "Serge" Mar 2008 Phi(4,2^7658614+1)/2 216438 Posts Here's the group order [ <2, 3>, <3, 1>, <11, 1>, <13, 2>, <31, 1>, <3319, 1>, <14593, 1>, <29921, 1>, <310889, 1>, <445141, 1>, <1580023, 1>, <2060137, 1>, <16801493, 1>, <39731539, 1>, <9219709386119, 1> ] (!)
 2013-08-02, 18:09 #5 wombatman I moo ablest echo power!     May 2013 3·577 Posts Nicely done! If you don't mind me asking, about how long did it take to find this factor? I'm inexperienced with ECM work, so I have no idea how to even guess at it.
2013-08-02, 18:46   #6
retina
Undefined

"The unspeakable one"
Jun 2006
My evil lair

7·827 Posts

Quote:
 Originally Posted by wombatman Nicely done! If you don't mind me asking, about how long did it take to find this factor? I'm inexperienced with ECM work, so I have no idea how to even guess at it.
Umm, let's see:
Quote:
 Originally Posted by ryanp Code: ... Step 1 took 1891828ms Step 2 took 688319ms ...
Or did you mean how long since the invention of numbers?

 2013-08-02, 19:04 #7 debrouxl     Sep 2009 97710 Posts wombatman might just have missed the data in ryanp's post, but he might have meant something along the lines of "how much effort (in core-time unit) have been spent by ryanp on this factorization (in addition to all of the other curves run before the winning batch) ?".
 2013-08-02, 19:34 #8 wombatman I moo ablest echo power!     May 2013 3×577 Posts Yeah, I was able to read the specific stage 1 and stage 2 numbers, but given that the stage 1 came out to about half an hour and the total time was about 45 minutes, unless he was spectacularly lucky (and nobody else was), that would be an astonishingly quick find. So yes, retina, I was asking about the total time (number of curves, etc) to actually find that factor--not just the time which was already listed... Last fiddled with by wombatman on 2013-08-02 at 19:35

 Similar Threads Thread Thread Starter Forum Replies Last Post ryanp Factoring 6 2013-11-26 09:33 aketilander Factoring 4 2012-08-08 18:09 unconnected Factoring 31 2010-06-26 04:07 Raman Factoring 4 2010-04-01 13:57 ewmayer Math 5 2003-05-14 15:08

All times are UTC. The time now is 06:52.

Thu Oct 22 06:52:07 UTC 2020 up 42 days, 4:03, 0 users, load averages: 0.94, 1.26, 1.31