Cantor–Zassenhaus algorithm: Difference between revisions

Revision as of 06:26, 31 May 2008

Revision as of 06:27, 31 May 2008

Line 16:

g(x) & {} \equiv g_1(x) \pmod{p_1(x)}, \\

g(x) & {} \equiv g_2(x) \pmod{p_2(x)}, \\

& {} \ \ \vdots \\

g(x) & {} \equiv g_s(x) \pmod{p_s(x)},

\end{align}