Show that if p is prime and k is a positive integer, then the only solutions of x2 ≡ x (mod pk) are those integers x such that x ≡ 0 or 1 (mod pk).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.