Advertisements
Advertisements
प्रश्न
By the principle of mathematical induction, prove the following:
2n > n, for all n ∈ N.
Advertisements
उत्तर
Let P(n) denote the statement 2n > n for all n ∈ N
i.e., P(n): 2n > n for n ≥ 1
Put n = 1, P(1): 21 > 1 which is true.
Assume that P(k) is true for n = k
i.e., 2k > k for k ≥ 1
To prove P(k + 1) is true.
i.e., to prove 2k+1 > k + 1 for k ≥ 1
Since 2k > k
Multiply both sides by 2
2 . 2k > 2k
2k+1 > k + k
i.e., 2k+1 > k + 1 (∵ k ≥ 1)
∴ P(k + 1) is true whenever P(k) is true.
∴ By principal of mathematical induction P(n) is true for all n ∈ N.
APPEARS IN
संबंधित प्रश्न
By the principle of mathematical induction, prove the following:
13 + 23 + 33 + ….. + n3 = `("n"^2("n + 1")^2)/4` for all x ∈ N.
By the principle of mathematical induction, prove the following:
1.2 + 2.3 + 3.4 + … + n(n + 1) = `(n(n + 1)(n + 2))/3` for all n ∈ N.
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 the following:
52n – 1 is divisible by 24, for all n ∈ N.
By the principle of mathematical induction, prove the following:
n(n + 1) (n + 2) is divisible by 6, for all n ∈ N.
By the principle of Mathematical induction, prove that, for n ≥ 1
1.2 + 2.3 + 3.4 + ... + n.(n + 1) = `("n"("n" + 1)("n" + 2))/3`
Using the Mathematical induction, show that for any natural number n ≥ 2,
`1/(1 + 2) + 1/(1 + 2 + 3) + 1/(1 +2 + 3 + 4) + .... + 1/(1 + 2 + 3 + ... + "n") = ("n" - 1)/("n" + 1)`
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
