Advertisements
Advertisements
प्रश्न
Prove that the product of three consecutive positive integer is divisible by 6.
उत्तर
Let, n be any positive integer. Since any positive integer is of the form 6q or 6q + 1 or 6q + 2 or, 6q + 3 or 6q + 4 or 6q + 5.
If n = 6q, then
n(n + 1)(n + 2) = (6q + 1)(6q + 2)(6q + 3)
= 6[(6q + 1)(3q + 1)(2q + 1)]
= 6m, which is divisible by 6?
If n = 6q + 1, then
n(n + 1)(n + 2) = (6q + 2)(6q + 3)(6q + 4)
= 6[(6q + 1)(3q + 1)(2q + 1)]
= 6m, which is divisible by 6
If n = 6q + 2, then
n(n + 1)(n + 2) = (6q + 2)(6q + 3)(6q + 4)
= 6[(3q + 1)(2q + 1)(6q + 4)]
= 6m, which is divisible by 6.
If n = 6q + 3, then
n(n + 1)(n + 2) = (6q + 3)(6q + 4)(6q + 5)
= 6[(6q + 1)(3q + 2)(2q + 5)]
= 6m, which is divisible by 6.
If n = 6q + 4, then
n(n + 1)(n + 2) = (6q + 4)(6q + 5)(6q + 6)
= 6[(6q + 4)(3q + 5)(2q + 1)]
= 6m, which is divisible by 6.
If n = 6q + 5, then
n(n + 1)(n + 2) = (6q + 5)(6q + 6)(6q + 7)
= 6[(6q + 5)(q + 1)(6q + 7)]
= 6m, which is divisible by 6.
Hence, the product of three consecutive positive integer is divisible by 6.
APPEARS IN
संबंधित प्रश्न
Using Euclid's division algorithm, find the H.C.F. of 196 and 38220
Prove that the product of two consecutive positive integers is divisible by 2.
Prove that the square of any positive integer is of the form 3m or, 3m + 1 but not of the form 3m +2.
Find the largest number which exactly divides 280 and 1245 leaving remainders 4 and 3, respectively.
What do you mean by Euclid’s division algorithm?
Find the smallest number which when divides 28 and 32, leaving remainders 8 and 12 respectively.
What is a composite number?
The sum of two prime number is always a prime number (True/ False).
The LCM of two numbers is 1200. Which of the following cannot be their HCF?
Prove that one of any three consecutive positive integers must be divisible by 3.
