Content deleted Content added
NathanZook (talk | contribs) m →Rabin's test of irreducibility: Removed spurious "mod f" when setting h. (the gcd in the next step is unaffected) Tag: Reverted |
NathanZook (talk | contribs) Undid revision 989751936 by NathanZook (talk) |
||
Line 267:
<math>n_j=n/p_j</math>;
'''for''' ''i'' = 1 to ''k'' '''do'''
<math>h:=x^{q^{n_i}}-x \bmod f</math>;
''g'' := gcd(''f'', ''h'');
'''if''' ''g'' ≠ 1, '''then return''' "''f'' is reducible" '''and STOP''';
| |||