Ask
your own question, for FREE!
Mathematics
7 Online
Show that if n is a composite integer with \(n\neq 4\) , then \((n-1)! \equiv 0~(mod n\) Please, help
Still Need Help?
Join the QuestionCove community and study together with friends!
" n is a composite integer" the next largest after n = 4 is n = 6 if n = 6, then (n-1)! = (6-1)! = 5! = 5*4*3*2*1 Notice how 2*3 = 6 is a factor, so 5! = 0 (mod 6) If n = 8 (the next composite integer) then (n-1)! = (8-1)! = 7! = 7*6*5*4*3*2*1 and we see 4*2 = 8 as a factor, so 7! = 0 (mod 8) ------------------------------- In general, if n is composite then n = p*q where p and q are smaller integers that will be factors of (n-1)! since the factorial counts down to 1
|dw:1446171419114:dw|
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
Maci:
what are the best stock apps for people who want to start investing?
Twaylor:
genuienly how do i get better self control i keep watcing youtube and theres this
IzzyCookie:
|dw:1792074056138:dw| Uhm, I don't know where to ask this, but I'm in college welding at my community college, and I need help learning vertical welding for
thehearken:
not sure if this is considered spam, im sorry if it is, but does anyone have tips
3 days ago
3 Replies
2 Medals
6 days ago
3 Replies
0 Medals
1 day ago
9 Replies
1 Medal
1 week ago
2 Replies
1 Medal