Revision as of 03:17, 10 October 2021 edit Rcgldr (talk \| contribs) Extended confirmed users 2,505 edits →Trying to understand how any of these methods would work for f(x) with coefficients in GF(p^r) ← Previous edit		Revision as of 20:50, 15 October 2021 edit undo Rcgldr (talk \| contribs) Extended confirmed users 2,505 edits →Trying to understand how any of these methods would work for f(x) with coefficients in GF(p^r) Next edit →
Line 81: {{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)? ==

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