Prove (n−1)!=−1 (mod n) iff n is prime
I can understand how the first part of the proof (n−1)!=−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.
How to find limh→0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
No comments:
Post a Comment