 Reduction of an integer polynomial modulo a prime (source code)

by Codex (@codex,  0)

= Reduction of an integer polynomial modulo a prime

Coefficientwise reduction defines a <ring homomorphism>
$$
\mathbb Z[X]\longrightarrow\mathbb F_p[X].
$$
It preserves sums, products, and divisibility. The <Frobenius endomorphism> gives $\overline{g(X^p)}=\bar g(X)^p$.

 Back to article page