mersenneforum.org Factoring humongous Cunningham numbers
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2006-04-12, 17:51   #34
xilman
Bamboozled!

"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across

1158210 Posts

Quote:
 Originally Posted by R.D. Silverman It is quite possible. I have not checked them. Which factor?
When I get my act together (the Easter weekend, I hope) I'll run the same data-preening code that is used on the other tables I maintain.

Paul

 2006-04-12, 17:52 #35 Phil MjX     Sep 2004 5×37 Posts 400 (16,80) 19995617469086942401.C134 19995617469086942401=P10 * P10 P10 = 4388625601 P10 = 4556236801 with Tomabechi P-1 (including apr-cl) oops, 3 min too late !! P.S. Last fiddled with by Phil MjX on 2006-04-12 at 17:53
2006-04-12, 19:03   #36
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

23×937 Posts

Quote:
 Originally Posted by Greenbank 400 (16,80) 19995617469086942401.C134 19995617469086942401 = 4388625601 x 4556236801
It is probable that this was found by P-1 and that the factor
was not checked for primality...... mea culpa.

2006-04-12, 19:36   #37
Andi47

Oct 2004
Austria

2·17·73 Posts

Quote:
 Originally Posted by Andreas Schinde Done 648 curves on 3^379+2^379 using GMP-ECM at B1=1e6 and B2=default, no factor found. Together with Silverman's ~300 curves this should have finished the 35 digit range. Now running a some curves with B1=3e6 at this number.
Done 300 curves with B1=3e6, no factor found.

2006-04-12, 23:17   #38
Greenbank

Jul 2005

2·193 Posts

Quote:
 Originally Posted by R.D. Silverman It is probable that this was found by P-1 and that the factor was not checked for primality...... mea culpa.
Looks that way, those factors are both very smooth:-

4388625600 = 2^6 x 3 x 5^2 x 89 x 10273
4556236800 = 2^11 x 3 x 5^2 x 29663

 2006-04-13, 09:19 #39 Jushi     Sep 2005 UGent 22×3×5 Posts Some ECM work: Some ECM work (format: [#curves]@[B1 bound], other parameters are the ecm default) 3,2,343- (C136) 650@1e6, 40@3e6 3,2,371- (C141) 2440@3e6 3,2,391- (C161) 345@1e6
 2006-04-13, 12:35 #40 Yamato     Sep 2005 Berlin 2·3·11 Posts For those who are interested: Look at http://www.cip.mathematik.uni-stuttg...nt/ex3k2k.html
2006-04-13, 12:44   #41
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

749610 Posts

Quote:
 Originally Posted by Yamato For those who are interested: Look at http://www.cip.mathematik.uni-stuttg...nt/ex3k2k.html

You have some composites in your results that I have already finished.
I have finished everything for 3^n +/- 2^n up to n = 336 (3^335 - 2^335)
was just finished here a day or two ago by someone else.

I could easily finish everything to n = 400, but I am busy with other
things...

 2006-04-13, 15:44 #42 akruppa     "Nancy" Aug 2002 Alexandria 9A316 Posts This thread fits better into Factoring than GMP-ECM. Moved. Alex
 2006-04-13, 15:49 #43 Pascal Ochem     Apr 2006 6A16 Posts The factors of the C111 from 3^372+2^372 are: 840497702349180597209469882198293789055301120886641 (pp51) 766974650561302741840583863816378225180158232426458907919137 (pp60) with ggnfs (pp=probable prime)
2006-04-13, 16:00   #44
R.D. Silverman

"Bob Silverman"
Nov 2003
North of Boston

23×937 Posts

Quote:
 Originally Posted by Pascal Ochem The factors of the C111 from 3^372+2^372 are: 840497702349180597209469882198293789055301120886641 (pp51) 766974650561302741840583863816378225180158232426458907919137 (pp60) with ggnfs (pp=probable prime)
Nice. I am a bit surprised however. I didn't think enough ECM
effort had been expended to proceed with NFS on these numbers.

 Similar Threads Thread Thread Starter Forum Replies Last Post wpolly Factoring 29 2022-10-25 00:46 Xyzzy Cunningham Tables 42 2014-04-02 18:31 jasong GMP-ECM 6 2006-06-30 08:51 jasong Factoring 1 2006-04-03 17:18 jasong Factoring 27 2006-03-21 02:47

All times are UTC. The time now is 11:44.

Sun Dec 4 11:44:59 UTC 2022 up 108 days, 9:13, 0 users, load averages: 0.87, 0.95, 0.98

Copyright ©2000 - 2022, 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.

โ  ยฑ โ รท ร ยท โ โ โฐ โ โ โ โ โ โค โฅ โฆ โง โจ โฉ โบ โป โผ โฝ โ โ โ โ ยฒ ยณ ยฐ
โ  โ ยฐ โ ~ โ โ โซ
โก โ โ โ โ โช โซ โโ โโ โ โ โ โ โง โจ โฉ โช โจ โ โ ๐ ๐ ๐ โฒ โณ
โ โ โ โฆ โฃ โฉ โช โ โ โ โ โ โ โ โ โ โ โ โ โ โ โค โ โ โ โต โถ โท โธ ๐
ยฌ โจ โง โ โ โ โ โ โ โ โ โ โด โต โค โฅ โข โจ โซค โฃ โฆ โฏ โฎ โฐ โฑ
โซ โฌ โญ โฎ โฏ โฐ โ โ ฮด โ โฑ โ โ
๐ข๐ผ ๐ฃ๐ฝ ๐ค๐พ ๐ฅ๐ฟ ๐ฆ๐๐ ๐ง๐ ๐จ๐ ๐ฉ๐๐ ๐ช๐ ๐ซ๐ ๐ฌ๐ ๐ญ๐ ๐ฎ๐ ๐ฏ๐ ๐ฐ๐ ๐ฑ๐ ๐ฒ๐ ๐ด๐๐ ๐ต๐ ๐ถ๐ ๐ท๐๐ ๐ธ๐ ๐น๐ ๐บ๐