Let x be an integer. let p be a prime.Suppose that x^2 == x mod p. Show that ...

Mathematics
Tutor: None Selected Time limit: 1 Day

Topic: Elementary Number Theory

Let x be an integer. let p be a prime. Suppose that x^2 == x mod p. Show that either x == 0 mod p, or x == 1 mod p

Apr 7th, 2015

Note that we have

If x^2 ≡ x (mod p), 

then x(x − 1) ≡ 0 (mod p). 

Thus p | x(x − 1),   so p | x or p | x − 1. 

Hence the only solutions are x ≡ 0 (mod p) or x ≡ 1 (mod p).

Hence Proved

Apr 7th, 2015

Are you studying on the go? Check out our FREE app and post questions on the fly!
Download on the
App Store
...
Apr 7th, 2015
...
Apr 7th, 2015
Dec 6th, 2016
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer