All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Remainder (Posted on 2003-10-16) Difficulty: 3 of 5
If 'p' be a prime, then what is the remainder when (p - 1)! is divided by p?

See The Solution Submitted by Ravi Raja    
Rating: 3.8889 (9 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
We are in a field | Comment 7 of 10 |
The integers mod p are a field for any prime p, so we can add, subtract, multiply and divide (except by 0) at will. Also, any polynomial equation of degree n has at most n solutions. Multiplying the nonzero elements together, we must get a number that is -1 mod p, because an even number of these elements are not self-reciprocal and therefore the reciprocals pair up, while the self-reciprocal element(s) are p-1 (congruent to -1) and 1 (since the equation x^2=1 has only these 2 solutions).
  Posted by Richard on 2003-11-21 14:32:16
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (13)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information