2.14 Prove that if $n > 4$ is composite then \newline $(n-1)! \equiv 0 \pmod{n}$.
Added by Jacqueline Z.
Close
Step 1
Step 1: Since n > 4 is composite, it has a divisor d such that 1 < d < n. Show more…
Show all steps
Your feedback will help us improve your experience
Suman K and 66 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let n be a composite integer greater than 4. Prove that (n - 1)! ≡ 0 mod n.
Suman K.
If n is an integer greater than 1 and (n-1)! =1 mod n, prove that n is prime.
Hoan N.
Prove that 1·1! + 2·2! + ... + n·n! = (n+1)! - 1 whenever n is a positive integer.
David M.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD