Advertisements
Advertisements
Question
For any positive integer n, prove that n3 – n is divisible by 6.
Solution
Let a = n3 – n
`\implies` a = n – (n2 – 1)
`\implies` a = n – (n – 1)(n + 1) ......[∵ (a2 – b2) = (a – b)(a + b)]
`\implies` a = (n – 1) n (n + 1)
We know that, if a number is divisible by both 2 and 3, then it is also divisible by 6.
n – 1, n and n + 1 are three consecutive integers.
Now, a = (n – 1 ) n (n + 1) is product of three consecutive integers.
So, one out of these must be divisible by 2 and another one must be divisible by 3.
Therefore, a is divisible by both 2 and 3.
Thus, a = n3 – n is divisible by 6.
APPEARS IN
RELATED QUESTIONS
Define HOE of two positive integers and find the HCF of the following pair of numbers:
475 and 495
Three sets of English, Mathematics and Science books containing 336, 240 and 96 books respectively have to be stacked in such a way that all the books are stored subject wise and the height of each stack is the same. How many stacks will be there?
Find the missing numbers in the following factorization:
Express each of the following integers as a product of its prime factors:
420
Prove that following numbers are irrationals:
Every odd integer is of the form 2m − 1, where m is an integer (True/False).
The sum of two irrational number is an irrational number (True/False).
The smallest number by which \[\sqrt{27}\] should be multiplied so as to get a rational number is
Use Euclid's division algorithm to find the HCF of 255 and 867.
Prove that one and only one out of n, n + 2 and n + 4 is divisible by 3, where n is any positive integer.