mersenneforum.org Factoring for a publication
 Register FAQ Search Today's Posts Mark Forums Read

2021-06-18, 21:33   #342
charybdis

Apr 2020

1011100112 Posts

Quote:
 Originally Posted by Max0526 Two best spun polys (+12%):
Thank you!

2021-06-19, 04:38   #343
bsquared

"Ben"
Feb 2007

22×3×293 Posts

Quote:
 Originally Posted by Max0526 Spun polys (+9.6%):
Fantastic, thank you. Sieving is already done, filtering is running with LA to follow. Should have factors sometime tomorrow I'd guess. Since this one was so similar in size to the last, I reused most of the parameters. But I ran 15e with 31/29 instead of 14e with 32/30, and adjusted mfb's downward correspondingly.

 2021-06-19, 14:23 #344 richs     "Rich" Aug 2002 Benicia, California 2·659 Posts (5, -9) C251 ecm'ed to t45. Continuing to t50.
 2021-06-19, 14:35 #345 bsquared     "Ben" Feb 2007 1101101111002 Posts C203 from (3,-9) factors as: Code: PRP103 = 1926631727570020844912755395588481807661615087447805197083800610681819030953233712099667958420736155599 PRP101 = 23149317273583696921116433865306378439328646015630744332899206277397247732866795937210636767359666181 150082763 relations gathered, 137298984 unique built a 8.4M matrix.
 2021-06-19, 23:44 #346 charybdis     Apr 2020 7·53 Posts Taking (6,-8) c179. Test-sieving suggested SNFS is slightly faster than GNFS. There was very little to choose between Max's two spun polys so I went with the first one. I'm using I=15 and lpb 32/30.
 2021-06-20, 10:14 #347 fivemack (loop (#_fork))     Feb 2006 Cambridge, England 3·2,141 Posts (5,-8) C209 complete by SNFS Unspun polynomial Code: n: 16565142879290504125073762823767688357919065144905054524206541804478927498295871968740614207813511789416877059764381461295498833321565662655267058786104869169924987607710560565878863482569594348028360005558029 skew: 3.7 c4: 1 c3: -6 c2: 17 c1: -84 c0: 196 Y0: -43070674852707955981472641819129110567338930886162219 Y1: 9307684042037302713836537085227216320008466867809161 lpbr: 30 lpba: 28 mfbr: 90 mfba: 56 rlambda: 3.6 alambda: 2.6 alim: 56000000 rlim: 56000000 sieved for about 6500 thread-hours for Q=7.6M - 84M P51 * P158; possibly t55 ECM would have found the factor faster.
2021-06-20, 10:19   #348
fivemack
(loop (#_fork))

Feb 2006
Cambridge, England

191716 Posts

Quote:
 Originally Posted by bsquared C203 from (3,-9) factors as: Code: PRP103 = 1926631727570020844912755395588481807661615087447805197083800610681819030953233712099667958420736155599 PRP101 = 23149317273583696921116433865306378439328646015630744332899206277397247732866795937210636767359666181 150082763 relations gathered, 137298984 unique built a 8.4M matrix.
Nice work!

 2021-06-20, 12:37 #349 EdH     "Ed Hall" Dec 2009 Adirondack Mtns 2×33×71 Posts Is (12, 0) c147 still unclaimed? I'll run it to t50 while seeing if someone else hollars at me to desist. If it survives and no one else is running it, I'll GNFS it.
2021-06-20, 15:37   #350
swishzzz

Jan 2012

1318 Posts

Quote:
 Originally Posted by EdH Is (12, 0) c147 still unclaimed? I'll run it to t50 while seeing if someone else hollars at me to desist. If it survives and no one else is running it, I'll GNFS it.
Doesn't look like it, reserved it for EdH.

2021-06-20, 15:58   #351
EdH

"Ed Hall"
Dec 2009

2·33·71 Posts

Quote:
 Originally Posted by swishzzz Doesn't look like it, reserved it for EdH.
Thanks! I'll GNFS it this afternoon (local).

 2021-06-20, 20:11 #352 EdH     "Ed Hall" Dec 2009 Adirondack Mtns 2·33·71 Posts (10, -6): The only thing left is the c258, which has survived t50.

 Similar Threads Thread Thread Starter Forum Replies Last Post baih Miscellaneous Math 9 2020-09-21 07:11 xx005fs GPU Computing 3 2018-10-27 14:49

All times are UTC. The time now is 01:48.

Mon Aug 2 01:48:35 UTC 2021 up 9 days, 20:17, 0 users, load averages: 1.26, 1.56, 1.41

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.