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.)
Hints/Tips a big hint | Comment 3 of 10 |
A restatement of this problem is:

Given:
(p-1)! = p * q + m

where:
p is a prime number,
q is some integer, and
m is some integer between 0 and p-1 (the remainder)

What is m? And yes, by inspection, m = p-1. Prove it.
  Posted by SilverKnight on 2003-10-16 09:58:22
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 (16)
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