mersenneforum.org SNFS polynomials.
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2012-03-10, 16:06 #1 chris2be8     Sep 2009 24·5·31 Posts SNFS polynomials. I had a look at the SNFS polynomials generated by factordb and noticed it generates very bad ones. Eg: http://factorization.ath.cx/index.ph...00000487178750 which is (14754135833^11-1)/132772468352168 gets: Code:  n: 54317968970751484973310399914288545196091168576179094060078804933353377706605252225479726219559637 m: 217684524178614603889 deg: 4 skew: 0 type: snfs c4: 3211747038473252619535796054537 c0: -1 rlim: 343800 alim: 343800 lpbr: 25 lpba: 25 mfbr: 45 mfba: 45 rlambda: 2.2 alambda: 2.2 An inverted quintic would be much better. And http://factorization.ath.cx/index.ph...00000479069951 which is (6638^31+1)/2316174361302856299249 gets: Code:  n: 13133589571432270898222759874366292680873211449040207724769678781837619196179064309751019775966737 m: 567885443330209974916203392 deg: 4 skew: 0 type: snfs c4: 292490486072 c0: 1 rlim: 343800 alim: 343800 lpbr: 25 lpba: 25 mfbr: 45 mfba: 45 rlambda: 2.2 alambda: 2.2 A quartic for a^b+1 with b of the form 4n+3 wants something like: Code:  m: a^(n+1) c4: 1 c0: a The skew should not be 0 either! I've not looked at alim etc but would not trust them. Chris
 2012-03-10, 16:49 #2 firejuggler     "Vincent" Apr 2010 Over the rainbow 37·79 Posts it's auto-generated, give it some slack! I think that the original idea was more like to give an idea of what the snfs poly should look like.

 Similar Threads Thread Thread Starter Forum Replies Last Post Till Factoring 12 2021-08-04 21:01 fivemack YAFU 22 2012-03-12 18:48 yemsy Aliquot Sequences 1 2011-02-17 10:25 mdettweiler Factoring 15 2010-01-14 21:13 Orgasmic Troll Puzzles 4 2003-09-16 16:23

All times are UTC. The time now is 11:46.

Sat Sep 23 11:46:16 UTC 2023 up 10 days, 9:28, 0 users, load averages: 1.11, 1.10, 1.08

Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.

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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔