Saturday, 15 June 2013

Proof in modern algebra. Prove (n1)!=1(textrmmodn) iff n is prime

Prove (n1)!=1 (mod n) iff n is prime



I can understand how the first part of the proof (n1)!=1 (mod n) is true if n is prime simply by testing it out. However, I'm unsure of how to go about proving it.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...