How to prove (p-1)! = -1 (mod p), p is a prime.

  • Thread starter lifom
  • Start date
  • #1
14
0
(p-1)! = -1(mod p), where p is a prime
I have tried small values of p but I can't find any pattern. Can anyone give me some hints or directions? I don't know a detail proof. Thank you
 

Answers and Replies

  • #2
1,056
0
The matter turns on inverses. For every a in the system there is an a^-1, such that a*a^-1 = 1. (Generally that is an axiom of the group property.)
 

Related Threads on How to prove (p-1)! = -1 (mod p), p is a prime.

Replies
12
Views
7K
Replies
2
Views
2K
  • Last Post
Replies
6
Views
8K
  • Last Post
Replies
3
Views
2K
  • Last Post
2
Replies
25
Views
11K
  • Last Post
Replies
3
Views
3K
Top