Advertisements
Advertisements
प्रश्न
By the principle of mathematical induction, prove the following:
n(n + 1) (n + 2) is divisible by 6, for all n ∈ N.
Advertisements
उत्तर
P(n): n(n + 1) (n + 2) is divisible by 6.
P(1): 1 (2) (3) = 6 is divisible by 6
∴ P(1) is true.
Let us assume that P(k) is true for n = k
That is, k (k + 1) (k + 2) = 6m for some m
To prove P(k + 1) is true i.e. to prove (k + 1) (k + 2)(k + 3) is divisible by 6.
P(k + 1) = (k + 1) (k + 2) (k + 3)
= (k + 1)(k + 2)k + 3(k + 1)(k + 2)
= 6m + 3(k + 1)(k + 2)
In the second term either k + 1 or k + 2 will be even, whatever be the value of k.
Hence second term is also divisible by 6.
∴ P (k + 1) is also true whenever P(k) is true.
By Mathematical Induction P (n) is true for all values of n.
APPEARS IN
संबंधित प्रश्न
By the principle of mathematical induction, prove the following:
4 + 8 + 12 + ……. + 4n = 2n(n + 1), for all n ∈ N.
By the principle of mathematical induction, prove the following:
an – bn is divisible by a – b, for all n ∈ N.
By the principle of mathematical induction, prove that, for n ≥ 1
12 + 32 + 52 + ... + (2n − 1)2 = `("n"(2"n" - 1)(2"n" + 1))/3`
Prove that the sum of the first n non-zero even numbers is n2 + n
Prove by Mathematical Induction that
1! + (2 × 2!) + (3 × 3!) + ... + (n × n!) = (n + 1)! − 1
Using the Mathematical induction, show that for any natural number n, x2n − y2n is divisible by x + y
Use induction to prove that 5n+1 + 4 × 6n when divided by 20 leaves a remainder 9, for all natural numbers n
Choose the correct alternative:
In 3 fingers, the number of ways four rings can be worn is · · · · · · · · · ways
Choose the correct alternative:
If `""^("a"^2 - "a")"C"_2 = ""^("a"^2 - "a")"C"_4` then the value of a is
Choose the correct alternative:
1 + 3 + 5 + 7 + · · · + 17 is equal to
