Revision as of 06:31, 10 January 2011 edit CRGreathouse (talk \| contribs) Autopatrolled, Administrators 13,002 edits m links ← Previous edit		Revision as of 12:27, 19 April 2011 edit undo 14.139.128.15 (talk) →Core result Next edit →
Line 28: : <math>a(x) \neq 0, \pm 1 </math> : <math>a_i(x) \in \{0,-1,1\}\text{ for }i=1,2,\ldots, ns,</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:

Cantor–Zassenhaus algorithm: Difference between revisions