Answer Happy

Posted: **Tue Jul 12, 2022 12:09 pm**

: Let F X Be A Polynomial With Integer Coefficients And P Be A Prime Prove That The Congruence F X 0 Mod P Has Eithe 1 (15.64 KiB) Viewed 43 times

Let f(x) be a polynomial with integer coefficients and p be a prime. Prove that the congruence f(x)=0 (mod p²) has either p² solutions or it has at most p² - p + 1 solutions in Z₂2.