mersenneforum.org Reserved for MF - Sequence 276
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2017-05-05, 21:59 #12 unconnected     May 2009 Russia, Moscow 23·109 Posts BTW, sequence 3366 also needs some hard ECM on C195@i2180. I did full t55 (18000@11e7) but have limited resources to take it further.
 2017-05-06, 06:58 #13 yoyo     Oct 2006 Berlin, Germany 3×197 Posts Would it be possible to run stage 1 for the 10000 curves with B1=29e8 on GPU? And can somebody do it? I would run stage 2 afterwards.
 2017-05-06, 12:45 #14 swellman     Jun 2012 11×263 Posts AS276 I dropped a note to Ryan yesterday alerting him to the existence of this thread in case he had interest. This morning he sent me this Code: Input number is 146958403500264369785547548773534064181201262260218085297440392878383892186824414643378590631107799775986185342359664860673182664805915775593953028576817423653521299222191420905092930824557639076598363 (201 digits) Using MODMULN [mulredc:0, sqrredc:2] Using B1=7600000000, B2=324909696561468, polynomial Dickson(30), sigma=814068971 dF=1048576, k=25, d=11741730, d2=19, i0=629 Expected number of curves to find a factor of n digits: 35 40 45 50 55 60 65 70 75 80 8 21 60 190 660 2483 9979 42978 194971 938688 Step 1 took 39791886ms Using 24 small primes for NTT Estimated memory usage: 4777M Initializing tables of differences for F took 4615ms Computing roots of F took 149378ms Building F from its roots took 81163ms Computing 1/F took 29062ms Initializing table of differences for G took 1134ms Computing roots of G took 112613ms Building G from its roots took 85745ms Computing roots of G took 113386ms Building G from its roots took 88387ms Computing G * H took 14793ms Reducing G * H mod F took 15953ms Computing roots of G took 117551ms Building G from its roots took 86185ms Computing G * H took 15073ms Reducing G * H mod F took 15664ms Computing roots of G took 113218ms Building G from its roots took 86291ms Computing G * H took 15155ms Reducing G * H mod F took 15685ms Computing roots of G took 113035ms Building G from its roots took 89617ms Computing G * H took 15002ms Reducing G * H mod F took 16119ms Computing roots of G took 115256ms Building G from its roots took 88074ms Computing G * H took 14599ms Reducing G * H mod F took 15358ms Computing roots of G took 111318ms Building G from its roots took 87578ms Computing G * H took 14781ms Reducing G * H mod F took 15865ms Computing roots of G took 114522ms Building G from its roots took 87471ms Computing G * H took 14960ms Reducing G * H mod F took 16199ms Computing roots of G took 114005ms Building G from its roots took 87993ms Computing G * H took 15252ms Reducing G * H mod F took 15668ms Computing roots of G took 116615ms Building G from its roots took 90888ms Computing G * H took 16013ms Reducing G * H mod F took 15646ms Computing roots of G took 110877ms Building G from its roots took 87894ms Computing G * H took 14924ms Reducing G * H mod F took 15510ms Computing roots of G took 113445ms Building G from its roots took 88641ms Computing G * H took 15545ms Reducing G * H mod F took 15649ms Computing roots of G took 111441ms Building G from its roots took 87906ms Computing G * H took 15017ms Reducing G * H mod F took 15154ms Computing roots of G took 111244ms Building G from its roots took 88618ms Computing G * H took 15138ms Reducing G * H mod F took 16981ms Computing roots of G took 113272ms Building G from its roots took 86699ms Computing G * H took 14530ms Reducing G * H mod F took 17007ms Computing roots of G took 113789ms Building G from its roots took 88423ms Computing G * H took 15182ms Reducing G * H mod F took 15466ms Computing roots of G took 114517ms Building G from its roots took 91294ms Computing G * H took 16384ms Reducing G * H mod F took 16707ms Computing roots of G took 112979ms Building G from its roots took 87971ms Computing G * H took 16115ms Reducing G * H mod F took 15482ms Computing roots of G took 119187ms Building G from its roots took 91174ms Computing G * H took 15448ms Reducing G * H mod F took 16214ms Computing roots of G took 119303ms Building G from its roots took 89950ms Computing G * H took 15699ms Reducing G * H mod F took 16519ms Computing roots of G took 120544ms Building G from its roots took 91226ms Computing G * H took 16179ms Reducing G * H mod F took 16001ms Computing roots of G took 121619ms Building G from its roots took 91794ms Computing G * H took 15702ms Reducing G * H mod F took 16251ms Computing roots of G took 126970ms Building G from its roots took 93380ms Computing G * H took 15486ms Reducing G * H mod F took 16862ms Computing roots of G took 122080ms Building G from its roots took 91765ms Computing G * H took 17270ms Reducing G * H mod F took 16071ms Computing roots of G took 130862ms Building G from its roots took 96044ms Computing G * H took 17502ms Reducing G * H mod F took 18512ms Computing polyeval(F,G) took 168438ms Computing product of all F(g_i) took 586ms Step 2 took 6337368ms ********** Factor found in step 2: 3135163172555178875064536378046330234984169364877281361211958842231 Found probable prime factor of 67 digits: 3135163172555178875064536378046330234984169364877281361211958842231 Probable prime cofactor 46874243990462637310356201495732887005986266709475578981920765898213102249350955733998141848135127026706804456577752515184428860000573 has 134 digits A very lucky hit even for Ryan, though I fear toes may have been inadvertently stepped on. Last fiddled with by swellman on 2017-05-06 at 12:52
 2017-05-06, 15:47 #15 VBCurtis     "Curtis" Feb 2005 Riverside, CA 22·19·59 Posts I considered running some curves, and I certainly wouldn't think anything but "hellyea!" if I'd found that factor. Yay Ryan! Only a C191 next, within 15e NFS@home range. Extra Yay!
 2017-05-08, 09:35 #16 Dubslow Basketry That Evening!     "Bunslow the Bold" Jun 2011 40
 2017-05-08, 10:09 #17 LaurV Romulan Interpreter     Jun 2011 Thailand 22×7×11×29 Posts Yeah, my thinking too, haha, mother life is a bitch, isn't her?
 2017-05-08, 10:43 #18 yoyo     Oct 2006 Berlin, Germany 24F16 Posts Sequence is not reserved here https://www.rechenkraft.net/aliquot/AllSeq.html. If someone wants to work on it she/he can reserve it in the reservation thread. Does somebody work on it?
 2017-05-08, 17:27 #19 VBCurtis     "Curtis" Feb 2005 Riverside, CA 106048 Posts The sequence should be reserved by/to the forum, and this thread will track results. I'm a fan of using NFS@home when we can, but Ryan may wish to push a few terms on his own- I think that's his right, since he found the factor!
 2017-05-08, 21:56 #20 ryanp     Jun 2012 Boulder, CO 3248 Posts I don't really have the time to work on this sequence at the moment, so I'm happy to let the forum crack away at it for now.
 2017-05-10, 12:29 #21 swellman     Jun 2012 11·263 Posts Well folks, what's next? Anybody want to start ECM on the C191 at say the t50 level? I can help once it goes to the t55 level in a few days. Or is yoyo better suited for most/all of the ECM for this series?
 2017-05-11, 09:03 #22 Dubslow Basketry That Evening!     "Bunslow the Bold" Jun 2011 40

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post schickel Aliquot Sequences 2911 2020-11-24 18:01 RichD Aliquot Sequences 432 2020-10-29 00:57 sweety439 And now for something completely different 17 2017-06-13 03:49 petrw1 Lone Mersenne Hunters 82 2010-01-11 01:57 devarajkandadai Math 1 2007-08-25 15:23

All times are UTC. The time now is 00:50.

Sat Nov 28 00:50:45 UTC 2020 up 78 days, 22:01, 3 users, load averages: 1.34, 1.28, 1.24

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