Cantor–Zassenhaus algorithm: Difference between revisions

Revision as of 21:05, 22 March 2009

Revision as of 22:30, 23 April 2009

Line 28:

: <math>a(x) \neq 0, \pm 1 </math>

: <math>a_i(x) \in \{0,-1,1\}</math>\text{ for <math>}i=1,2,\ldots, n,</math>

where <math>a_i(x)</math> is the reduction of <math>a(x)</math> modulo <math>p_i(x)</math> as before, and if any two of the following three sets is non-empty:

and if any two of the following three sets is non-empty:

: <math>A = \{ i | a_i(x) = 0 \}, </math>