Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Wilson's theorem states that a natural number $n>1$ is a prime number if and only if

$$ (n-1)! \equiv -1 \pmod {n} $$

Can we prove it using Fermat's Little theorem? If yes, then how?

share|improve this question
    
en.wikipedia.org/wiki/… –  draks ... Dec 20 '12 at 16:42
    
Proving that if $n\gt 1$ and $(n-1)!\equiv -1\pmod{n}$ then $n$ is prime will not involve Fermat's Theorem, but that is the easy direction. –  André Nicolas Dec 20 '12 at 18:21
add comment

1 Answer

up vote 4 down vote accepted

Hint: Consider $(x-1)(x-2)...(x-(p-1))$.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.