for any positive integer n, prove n3-n is divisible by 6?
Answers
Answered by
4
So, we can say that one of the numbers among n, n – 1 and n + 1 is always divisible by 3. ⇒ n (n – 1) (n + 1) is divisible by 3. Similarly, whenever a number is divided 2, the remainder obtained is 0 or 1. ∴ n = 2q or 2q + 1, where q is some integer
Answered by
1
Answer:
For any positive no. n
we can write n^3-n as n(n^2-1)
and then you can put the value of n
Similar questions