> 
> Show that if p is prime, then the only solutions of the congruence $x^2\equiv x\pmod p$ are those integers $x$ such that $x\equiv \text{$0$ or $1$}\pmod p$.
> 
> 
> 

I can't even begin to prove this question.