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.)
Solution Puzzle Solution Comment 10 of 10 |
In terms of Wilson's Theorem:
p is a prime number if and only if,:
(p-1)! == - 1(mod p)
Consequently, the required remainder must be (p-1)

Edited on December 12, 2022, 3:47 am
  Posted by K Sengupta on 2022-12-12 03:45:14

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 (12)
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