Ask your own question, for FREE!
Mathematics 7 Online
OpenStudy (anonymous):

Prove: If n^3 ≡n (mod 6)

OpenStudy (inkyvoyd):

I remember this. this was annoying

ganeshie8 (ganeshie8):

Hint : \[n^3-n = n(n^2-1)=(n-1)n(n+1)\]

ganeshie8 (ganeshie8):

next, recall that any product of \(n\) consecutive integers is divisible by \(n!\) not that annoying :)

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!
Latest Questions
Arriyanalol: i need help
10 hours ago 7 Replies 1 Medal
Arriyanalol: CONGRATS to me
13 hours ago 8 Replies 2 Medals
Legomaster346: What colleges are good that are near Arab Alabama?
1 week ago 5 Replies 0 Medals
Arriyanalol: i need help
1 week ago 6 Replies 2 Medals
Arizona: does anyone know the percentage rate of 30,000 and 40,000
1 week ago 0 Replies 0 Medals
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!