◀ ▲ ▶Branches / Number-theory / Proposition: Counting the Roots of a Diophantine Polynomial Modulo a Prime Number
Proposition: Counting the Roots of a Diophantine Polynomial Modulo a Prime Number
Let $p$ be a prime number and let $f(x)=a_0+a_1x+\ldots+a_nx^n$ with $p\not\mid a_n$ be a polynomial integer coefficients $a_0,\ldots,a_n$ of degree $n.$ Then the Diophantine equation of congruences $f(x)(p)\equiv 0(p)$ has at most $n$ roots (i.e. integers $x$ causing the polynomial to evaluate to $0$ modulo $p$).
Table of Contents
Proofs: 1
Mentioned in:
Proofs: 1 2 3
Thank you to the contributors under CC BY-SA 4.0!
![](https://github.com/bookofproofs/bookofproofs.github.io/blob/main/_sources/_assets/images/calendar-black.png?raw=true)
- Github:
-
![bookofproofs](https://github.com/bookofproofs.png?size=32)
References
Bibliography
- Landau, Edmund: "Vorlesungen über Zahlentheorie, Aus der Elementaren Zahlentheorie", S. Hirzel, Leipzig, 1927
- Jones G., Jones M.: "Elementary Number Theory (Undergraduate Series)", Springer, 1998