![]() |
|
|
#276 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36×13 Posts |
85^139+139^85 is factored
Code:
GMP-ECM 7.0.4 [configured with GMP 6.1.2, --enable-asm-redc] [ECM] Input number is 2841747107510677109472530722539604824732551363233610885593228925146090895973779110012822395614807086191544556754794371983680733346436611491029744488518930864279758727110854082920779590498347840724572013105688504426205168353832778773 (232 digits) Using B1=100000000, B2=776268975310, polynomial Dickson(30), sigma=1:256751323 Step 1 took 1010067ms Step 2 took 324515ms ********** Factor found in step 2: 15053771906913794327135724067101394641891764532901 Found prime factor of 50 digits: 15053771906913794327135724067101394641891764532901 Composite cofactor has 183 digits Input number is 188773094549515444648143975702249623238645210696014391021632160587955656402155840156059335919838149803613292534570065654894720974264201073171879502613462187603080905164472899338577073 (183 digits) Using B1=1000000000, B2=17659461720820, polynomial Dickson(30), sigma=1:1016575810 Step 1 took 2691087ms Step 2 took 1026820ms ********** Factor found in step 2: 239740675248515257103180305011975464155422251221471647113 Found prime factor of 57 digits: 239740675248515257103180305011975464155422251221471647113 Prime cofactor 787405367711729339407421502406344316776789222539943841011419630631644970064636848581552527026491658698608445482466260272722921 has 126 digits |
|
|
|
|
|
#277 |
|
I moo ablest echo power!
May 2013
176910 Posts |
Nice couple of factors! |
|
|
|
|
|
#278 |
|
Jun 2012
57748 Posts |
Code:
Thu 2017/05/25 18:42:59 UTC GMP-ECM 7.0.4-dev [configured with GMP 6.1.0, --enable-asm-redc] [ECM] Thu 2017/05/25 18:42:59 UTC Input number is 127056272390379127973255555215131439563872129267708808918208217809449254141425887661661749826297383788263246503105352921933730619386156736578238526244932098291469517912849836173343839005830752341597782086289712760077742420650643730743113622921 (243 digits) Thu 2017/05/25 18:42:59 UTC Run 568 out of 1000: Thu 2017/05/25 18:42:59 UTC Using B1=300000000, B2=3178599824416, polynomial Dickson(30), sigma=1:2177137107 Thu 2017/05/25 18:42:59 UTC Step 1 took 1139203ms Thu 2017/05/25 18:42:59 UTC Step 2 took 273594ms Thu 2017/05/25 18:42:59 UTC ********** Factor found in step 2: 560190261342026703971271112642669552151545912311233659 Thu 2017/05/25 18:42:59 UTC Found prime factor of 54 digits: 560190261342026703971271112642669552151545912311233659 Thu 2017/05/25 18:42:59 UTC Prime cofactor 226809141747654097097472744064124348368843169440539479064706375658802479601241303042429299718633005960169504200552043035588738849229341173062876855354886652066988710952528833961314963132619 has 189 digits |
|
|
|
|
|
#279 |
|
Jun 2012
22·13·59 Posts |
C297_146_121 has a p56 factor, found thanks to Wombatman’s heavy lifting via GPU ECM. This factor survived 4K curves @B1=110e6, 7k curves @B1=850e6, and another ~1200 curves @B1=2.9e9 before being found. Ouch!
Code:
2017/11/17 19:41:38 UTC Using B1=2900000000-2900000000, B2=105101237217912, polynomial Dickson(30), sigma=3:2341346453 Fri 2017/11/17 19:41:38 UTC Step 1 took 0ms Fri 2017/11/17 19:41:38 UTC Step 2 took 3781308ms Fri 2017/11/17 19:41:38 UTC ********** Factor found in step 2: 74540233682544006675180778792597948374745334922457946443 Fri 2017/11/17 19:41:38 UTC Found prime factor of 56 digits: 74540233682544006675180778792597948374745334922457946443 Fri 2017/11/17 19:41:38 UTC Composite cofactor ((121^146+146^121)/19008621)/74540233682544006675180778792597948374745334922457946443 has 241 digits Last fiddled with by swellman on 2017-11-17 at 21:31 |
|
|
|
|
|
#280 | |
|
I moo ablest echo power!
May 2013
29×61 Posts |
Quote:
![]()
|
|
|
|
|
|
|
#281 |
|
Jun 2012
22×13×59 Posts |
Reservation moved to yoyo@Home. Last fiddled with by swellman on 2018-08-03 at 15:39 |
|
|
|
|
|
#282 |
|
Jun 2012
22×13×59 Posts |
Yoyo@Home user [H]auntjemima has found a xyyx project record factor
Code:
GMP-ECM 7.0.5-dev [configured with GMP 6.0.0, --enable-asm-redc, --enable-assert] [ECM] Tuned for x86_64/core2/params.h Running on folding4-i7 Input number is 559388816465126802974607455206343772696604290603345058762366637561108747327304730906614266288296919999266623322132279230575436742482485043490130331825170939975206349771850365912420121109359639635449 (198 digits) [Sun Aug 26 13:51:09 2018] Using MODMULN [mulredc:1, sqrredc:1] Using B1=260000000, B2=3178559884516, polynomial Dickson(30), sigma=0:9814203009833488824 dF=262144, k=4, d=2852850, d2=17, i0=75 Expected number of curves to find a factor of n digits: 35 40 45 50 55 60 65 70 75 80 23 82 335 1521 7650 42057 250476 1603736 1.1e+07 7.9e+07 Writing checkpoint to checkpnt at p = 89772763 Writing checkpoint to checkpnt at p = 179216137 Writing checkpoint to checkpnt at p = 260000000 Step 1 took 1743404ms ********** Factor found in step 1: 15417944440203121952250879465115375550405365371906754572834039494521 Found prime factor of 68 digits: 15417944440203121952250879465115375550405365371906754572834039494521 Prime cofactor 36281672867265644313794186558137419138452291268980473942139743636499895693848438229142206920488043966922257379857697532095360893569 has 131 digits Peak memory usage: 8MB Last fiddled with by swellman on 2018-08-27 at 09:43 |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Reservations | ET_ | FermatSearch | 226 | 2021-04-25 19:47 |
| Linear algebra reservations, progress and results | wombatman | NFS@Home | 2768 | 2018-06-02 15:06 |
| NFS results and reservations | XYYXF | XYYXF Project | 348 | 2017-09-08 04:38 |
| Reservations | kar_bon | Riesel Prime Data Collecting (k*2^n-1) | 129 | 2016-09-05 09:23 |
| Where are my reservations | fivemack | PrimeNet | 3 | 2016-02-08 17:58 |