![]() |
[QUOTE=henryzz;303954]Submitting it via the manual pages should work I believe.[/QUOTE]
I don't thing manual pages have an interface to understand Factor5 result file... And the number has been "factored" up to 58 bits, so I'm afraid it would get the result as "not needed". Luigi |
[QUOTE=ET_;304015]I don't thing manual pages have an interface to understand Factor5 result file...
And the number has been "factored" up to 58 bits, so I'm afraid it would get the result as "not needed". Luigi[/QUOTE] Ummm... looks like somebody already did it? [url]http://www.mersenne.org/report_exponent/?exp_lo=1951951&exp_hi=&B1=Get+status[/url] |
[QUOTE=axn;304016]Ummm... looks like somebody already did it? [url]http://www.mersenne.org/report_exponent/?exp_lo=1951951&exp_hi=&B1=Get+status[/url][/QUOTE]
George did :smile: And now it seems that factors from Factor5 are correctly parsed... as mfakto factors. Luigi |
I found a p49 using B1=1e6.
[CODE]Input number is (5531^67-1)/((5531-1)*4691*7639*169546202532506553053) (220 digits) Using B1=1000000, B2=1045563762, polynomial Dickson(6), sigma=3242206823 Step 1 took 6131ms Step 2 took 2964ms ********** Factor found in step 2: 2023546194016353969700609317605910159558455647591 Found probable prime factor of 49 digits: 2023546194016353969700609317605910159558455647591 Probable prime cofactor ((5531^67-1)/((5531-1)*4691*7639*169546202532506553053))/2023546194016353969700609317605910159558455647591 has 171 digits[/CODE]Group order: [CODE][ <2, 4>, <3, 1>, <5, 1>, <7, 2>, <29, 1>, <193, 1>, <293, 1>, <569, 1>, <75391, 1>, <117497, 1>, <246193, 1>, <400051, 1>, <592429, 1>, <356777087, 1> ][/CODE] |
split
Number: 651p5
N = 559007430218745352620529502663296494390817414568645194018976107287414915535017316968655240997845715706749659009053367748576378363137026861242671321 (147 digits) SNFS difficulty: 196 digits. Divisors found: r1=12371571076957498704998114167059669970166029449316416480525605559187410449 (pp74) r2=45184837620172350785568441248188692358999028528540570721596294221850246729 (pp74) Version: Msieve v. 1.50 (SVN Official Release) Total time: 135.02 hours. Factorization parameters were as follows: n: 559007430218745352620529502663296494390817414568645194018976107287414915535017316968655240997845715706749659009053367748576378363137026861242671321 Y0: -1361129467683753853853498429727072845824 Y1: 1 c0: 5 c5: 2 skew: 1.20 type: snfs Factor base limits: 12900000/12900000 Large primes per side: 3 Large prime bits: 28/28 Sieved rational special-q in [0, 0) Total raw relations: 25282042 Relations: 2741734 relations Pruned matrix : 1814943 x 1815171 Polynomial selection time: 0.00 hours. Total sieving time: 130.77 hours. Total relation processing time: 0.12 hours. Matrix solve time: 3.84 hours. time per square root: 0.29 hours. Prototype def-par.txt line would be: snfs,196,5,0,0,0,0,0,0,0,0,12900000,12900000,28,28,56,56,2.5,2.5,100000 total time: 135.02 hours. Intel64 Family 6 Model 42 Stepping 7, GenuineIntel Windows-7-6.1.7601-SP1 processors: 4, speed: 2.49GHz |
Another p49 of low group-order.
3853^53-1 is divisible by: 1420058309581268021424981304850352459305728462373 Group-order: [ <2, 2>, <3, 2>, <7, 1>, <31, 1>, <47, 1>, <53, 1>, <71, 1>, <103, 1>, <2081, 1>, <2843, 1>, <3539, 1>, <18097, 1>, <69001, 1>, <93871, 1>, <146347, 1>, <27782281, 1> ] |
cofactor of 4116.2251
[code]
factoring 140117290568490981826672718836130423516875239428685459712878717733824525498808437291994957142081214077263718256327210941986948522440257078564507 (144 digits) ... prp72 factor: 366611095122250364264398748520423236301999758401587252942773596977712457 prp72 factor: 382195990336210045109732472517209277653125484998252721789116016333715651 [/code] :skiing: |
nice split of 113^150-10^150
It's a nice split of [URL]http://factordb.com/index.php?query=113%5E150-10%5E150[/URL] - the 3 largest factors have the same digital length of 38.
|
GNFS avoided
[CODE]Using B1=3000000, B2=5706890290, polynomial Dickson(6), sigma=1923041326
Step 1 took 9109ms Step 2 took 3280ms ********** Factor found in step 2: 89519621689210280358284998297996904251720174803763 Found probable prime factor of 50 digits: 89519621689210280358284998297996904251720174803763 Probable prime cofactor ((5801^61-1)/((5801-1)*4027*5763040637*48081214823351791*195790721913324330907*1811340220375495245599))/89519621689210280358284998297996904251720174803763 has 105 digits[/CODE] |
I found a 133-bit (41 digit) prime factor of M60052913 using P-1 (stage 2, not Brent-Suyama) :grin:
[url]http://mersenne.ca/exponent.php?exponentdetails=60052913[/url] My personal best size for Mersenne numbers in the last 365 days. |
Nice
The 127-digit cofactor of 5477^47-1 split into p64*p64 by GNFS.
1114265553071098467904541311032802352164593311093011546232244179 3300971491600586999540080317809643144229845304207513396748353207 |
| All times are UTC. The time now is 21:53. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.