I am wondering how to formalize the logic behind the following answer:
- Any polynomial of degree exactly 2 over arithmetic modulo a prime $p>2$ has either 0 roots or 2 roots. Answer: True. Any linear polynomial has one root as one can set it to zero and solve. If there is 1 root, then factoring gives another.
I am trying to formally justify why if there is 1 root, then factoring yields another. I know that if polynomial of degree $d$ $P(x)$ has a root $a$, then it can be written as $(x-a)Q(x)$ for some degree $d-1$ polynomial $Q(x)$. We could then set $Q(x) \equiv 0 \pmod p$ and solve for $x$; however, how do we formally show that there is a solution and that the solution is different than $a$?