![]() |
![]() |
#1 |
Jul 2011
616 Posts |
![]()
I am having trouble with writing an SNFS polynomial of the form
(381*(3^381)-1)/(2*37*4223). Is it feasable to write a SNFS polynomial, or would GNFS be better? Matt Hill |
![]() |
![]() |
![]() |
#2 |
Nov 2003
22·5·373 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·37·127 Posts |
![]()
Try something like:
Code:
n: 70660119042903854046516409844370038935302985028064659122643072861070853843136559153244087740059607644464606489303319089200206965812929296697868636129615795714605815617265147516321 c5: 127 c0: -27 Y1: 1 Y0: -5474401089420219382077155933569751763 type: snfs skew: 0.73 Last fiddled with by Batalov on 2011-07-15 at 04:03 |
![]() |
![]() |
![]() |
#4 |
Mar 2007
Germany
10816 Posts |
![]()
You can try the snfs poly generator (experiment) from this site http://factorization.ath.cx/index.php
This option is new from Syd - more Informations here http://www.mersenneforum.org/showpos...postcount=1128 |
![]() |
![]() |
![]() |
#5 |
Jul 2011
1102 Posts |
![]()
Thanks guys.
I am new to SNFS, so I was playing around with the polys. I won't get around to running it for a day or so, until my gnfs C134 finishes. The link is useful too, as I was unsure about where to set the other factors of the search (rlim, alim, etc.) Matt Last fiddled with by mhill12 on 2011-07-15 at 11:24 |
![]() |
![]() |
![]() |
#6 |
Jul 2011
1102 Posts |
![]()
Are there any default guesses for skews, for a deg. 4, 5, and 6 poly of this type? I plan on doing some pretesting first, but I would like to know what skew values are good guesses for the degrees. I plan on testing each poly I have, then narrowing in on the right skew value.
|
![]() |
![]() |
![]() |
#7 | |
Nov 2003
22·5·373 Posts |
![]() Quote:
Computing the skew is easy. No need to guess. Let the polynomial be a_n x^n + .... + a_0. Set the skew to (a_0/a_n)^1/n [or its reciprocal depending on how the code uses it] |
|
![]() |
![]() |
![]() |
#8 | ||
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3×29×83 Posts |
![]() Quote:
Quote:
Last fiddled with by Dubslow on 2012-09-26 at 03:30 |
||
![]() |
![]() |
![]() |
#9 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2×37×127 Posts |
![]()
Thank you, Capt. Obvious!
|
![]() |
![]() |
![]() |
#10 |
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
11100001101012 Posts |
![]()
I'm Mjr. learned-how-to-do-this-a-few-hours-ago, and Cnl. wants-to-be-sure-his-intuition-is-correct-to-prevent-future-fsck-ups. (Note this is the "help" thread. Thanks for helping, I suppose.)
Last fiddled with by Dubslow on 2012-09-26 at 03:52 |
![]() |
![]() |
![]() |
#11 |
Sep 2008
Kansas
31·107 Posts |
![]()
Should we also re-visit the power-halving technique?
(I'm partly serious about this question for the newbies.) |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Polynomial selection | Max0526 | NFS@Home | 9 | 2017-05-20 08:57 |
msieve 1.52 with GPU polynomial selection | cgy606 | Msieve | 16 | 2016-10-06 14:16 |
2^877-1 polynomial selection | fivemack | Factoring | 47 | 2009-06-16 00:24 |
Polynomial selection | CRGreathouse | Factoring | 2 | 2009-05-25 07:55 |
Homogeneous Cunningham snfs poly selection? | nuggetprime | Factoring | 22 | 2008-08-15 10:01 |