Show that n(n^2-1) is divisible by 24 for any odd values of n greater than 2. Brainliest if you give the right answer.
Answers
Answered by
0
Answer:
Easier with congruences:
n3−n≡0mod3 for all n (that's Little Fermat's theorem),
If n is odd, n≡±1,±3mod8, so n2≡1mod8,
last, use the Chinese remainder theorem.
Hope it helps .
Please mark as Brainliest
Similar questions