Talk:Factorization of polynomials over finite fields: Difference between revisions

Revision as of 03:17, 10 October 2021

Latest revision as of 07:51, 22 July 2024

(3 intermediate revisions by 3 users not shown)

Line 1:

{{WikiProject banner shell|class=C|1=

{{WikiProject Mathematics}}

}}

== Article needs improvement ==

This is just to say that a lot of work seems to be necessary here. Lots of stuff with little rhyme or reason, like the sectioning of the article; the subsection called "example" is hard to decipher, one wonders what this is an example of. [[User:Marc van Leeuwen|Marc van Leeuwen]] ([[User talk:Marc van Leeuwen|talk]]) 14:33, 18 March 2011 (UTC)

Line 81 ⟶ 85:

{{outdent}}For Distinct-degree factorization algorithm, on the very first step (i==1), <math>g=\gcd(f, x^{q}-x)</math> = 1, same issue as the first algorithm. The size of the coefficients doesn't seem to matter if the values start off as 0 and 1. [[User:Rcgldr|Rcgldr]] ([[User talk:Rcgldr|talk]]) 00:54, 15 July 2020 (UTC)

[[{{ping:User:D.Lazard|D.Lazard]]}} - The Wiki article implies that Cantor–Zassenhaus will only work for odd order <math>q</math>. Is there an factoring algorithm for even order <math>q</math>, such as <math>2^n</math>? [[User:Rcgldr|Rcgldr]] ([[User talk:Rcgldr|talk]]) 03:17, 10 October 2021 (UTC)

== Square free factorization - are the polynomial coefficients GF(p) or GF(q)? ==