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

Home > Numbers
Factors and Primes (Posted on 2007-01-24) Difficulty: 3 of 5
Prove that n!-1 is a composite number when n>3 and n+2 is a prime.

No Solution Yet Submitted by atheron    
Rating: 4.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution No Subject | Comment 2 of 3 |
When n+2=p is a prime the numbers 1..n-1 mod p are a cyclic multiplicative group.

Thus, there is some number j 1<j<n such that
for for all k 1<=k<n there is some integer m j^m mod n+2 = k

Exactly two of the elements are thier own inverse:
1 (obviously)
p-1  (congruent to -1 mod p and -1*-1=1)

n! is the product of all of those elements that have an inverse.  So, arrange the factors into the pairs k, inverse(k) and you can see that n! is congruent to 1 mod p.  Thus, n!-1 is congruent to 0 mod p and so n!-1 is divisible by n+2.  For all n>3 n!-1 > n+2 so n!-1 is thus composite.

  Posted by Joel on 2007-01-25 02:45:12
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information