mersenneforum.org Too much choice!
 Register FAQ Search Today's Posts Mark Forums Read

 2018-06-19, 11:24 #1 fivemack (loop (#_fork))     Feb 2006 Cambridge, England 2·7·461 Posts Too much choice! Can anyone find a good SNFS polynomial for the C199 cofactor of Lucas(3780) ? 3780 = 2^2*3^3*5*7 so there's an abundance of options The cofactor comes from the primitive part (IE divide out gcd(lucas(3780),luc(i)) for all i<3780) but that primitive part is 362-digit, which is a pretty good suggestion that SNFS isn't going to be feasible Prim = 15121 * 53736481 * 33962559121 * 6158429615521 * 9273812418949276801 * P30 * P34 * P46 * C199
2018-06-19, 20:15   #2
R. Gerbicz

"Robert Gerbicz"
Oct 2005
Hungary

32×179 Posts

Quote:
 Originally Posted by fivemack The cofactor comes from the primitive part (IE divide out gcd(lucas(3780),luc(i)) for all i<3780) but that primitive part is 362-digit, which is a pretty good suggestion that SNFS isn't going to be feasible
Code:
L3780  (4,12,20,28,36,60,84,108,140,180,252,420,540,756,1260) 15121.53736481.33962559121.6158429615521.9273812418949276801.338983521116509142969734109521.2718889622968673971074256706599921.7418244848123538497235127551891038640015932161.C199
I'd say that if there is a better SNFS polynomial then there is also a so far unknown algebraic factorization here, what is very unlikely.

 Similar Threads Thread Thread Starter Forum Replies Last Post Brain GPU Computing 30 2019-10-19 19:19 jasong jasong 21 2018-02-11 00:55 davar55 Puzzles 40 2014-08-20 20:27 VBCurtis Factoring 4 2013-11-15 07:22 ixfd64 Lounge 0 2010-03-02 22:00

All times are UTC. The time now is 10:59.

Fri Feb 3 10:59:53 UTC 2023 up 169 days, 8:28, 1 user, load averages: 0.52, 0.69, 0.72