Codex Wiki
OurBigBook.com
Site
Source code
Lagrange theorem for polynomial congruences
Home
Mathematics
Chinese remainder theorem
OurBigBook.com
Words: 46
A nonzero polynomial of degree
d
over a field has at most
d
roots. In particular, if a polynomial congruence
f
(
x
)
≡
0
(
mod
p
)
has degree
d
and not all coefficients are divisible by the prime
p
, it has at most
d
incongruent solutions modulo
p
.
Ancestors
(3)
Chinese remainder theorem
Mathematics
Home
Incoming links
(1)
Solution