Ask
your own question, for FREE!
Mathematics
12 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
Aubree:
Guys, what does love feel like? I've been getting a tight chest and when I talk to him my heart rate hangs out around 100-120 beats per min, and when he doe
thereneelg:
ok... anyone have advice?? ...I did Choir all throughout Middle school and have ALWAYS been put in Soprano those three years.
kamariana:
The Byzantine Procopius is known for (5 points) reconquering much of the old Roma
chuckD:
hellp!!! what does it mean to describe a scientist as skeptical Why is sceptical
DoltonCarlee:
So like do y'all know anything about the first world war?
thehearken:
anyone know how to explain this so its easier for me to understand? b(1)=2, b(n)=
6 hours ago
8 Replies
1 Medal
1 day ago
6 Replies
1 Medal
2 days ago
0 Replies
0 Medals
2 days ago
2 Replies
1 Medal
1 day ago
2 Replies
0 Medals
1 day ago
5 Replies
2 Medals