Factorization of polynomials over finite fields: Difference between revisions

Revision as of 09:10, 7 July 2019

Revision as of 20:41, 10 March 2020

Line 268:

<math>h:=x^{q^{n_i}}-x \bmod f</math>;

''g'' := gcd(''f'', ''h'');

'''if''' ''g'' ≠ 1, '''then return''' '''f'' is reducible' '''and STOP''';

'''end for''';

<math>g:= x^{q^{n}}-x \bmod f</math>;

'''if''' ''g'' = 0, '''then return''' "''f'' is irreducible",

'''else return''' "''f'' is reducible"

'''end.'''