Answer the following: Prove, by method of induction, for all n ∈ N 2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n

Question

Answer the following:

Prove, by method of induction, for all n ∈ N

2 + 3.2 + 4.2² + ... + (n + 1)2^n–1 = n.2ⁿ

Sum

Solution

Let P(n) ≡ 2 + 3.2 + 4.2² + ... + (n + 1)2^n–1 = n.2^n-1 = n.2ⁿ, for all n ∈ N

Step I:

Put n = 1

L.H.S. = 2

R.H.S. = 1(2¹) = 2 = L.H.S.

∴ P(n) is true for n = 1

Step II:

Let us consider that P(n) is true for n = k

∴ 2 + 3.2 + 4.2² + … + (k + 1)2^k–1 = k.2^k …(i)

Step III:

We have to prove that P(n) is true for n = k + 1

i.e., to prove that

2 + 3.2 + 4.2² + …. + (k + 2)2^k = (k + 1)2^k+1

L.H.S. = 2 + 3.2 + 4.2² + …. + (k + 2)2^k

= 2 + 3.2 + 4.2² + …. + (k + 1)2^k–1 + (k + 2)2^k

= k.2^k + (k + 2).2^k …[From (i)]

= (k + k + 2).2^k

= (2k + 2). 2^k

= (k + 1).2.2^k

= (k + 1). 2^k+1

= R.H.S.

∴ P(n) is true for n = k + 1

Step IV:

From all steps above by the principle of mathematical induction, P(n) is true for all n ∈ N.

shaalaa.com

Principle of Mathematical Induction

Is there an error in this question or solution?

Q II. (1) (iii)Q II. (1) (ii)Q II. (1) (iv)

Chapter 4: Methods of Induction and Binomial Theorem - Miscellaneous Exercise 4.2 [Page 85]

APPEARS IN

Balbharati Mathematics and Statistics (Arts and Science) Part 2 [English] Standard 11 Maharashtra State Board

Chapter 4 Methods of Induction and Binomial Theorem
Miscellaneous Exercise 4.2 | Q II. (1) (iii) | Page 85

RELATED QUESTIONS

Prove the following by using the principle of mathematical induction for all n ∈ N: `1/2 + 1/4 + 1/8 + ... + 1/2^n = 1 - 1/2^n`

Prove the following by using the principle of mathematical induction for all n ∈ N:

`a + ar + ar^2 + ... + ar^(n -1) = (a(r^n - 1))/(r -1)`

Prove the following by using the principle of mathematical induction for all n ∈ N:

`1^2 + 3^2 + 5^2 + ... + (2n -1)^2 = (n(2n - 1) (2n + 1))/3`

Prove the following by using the principle of mathematical induction for all n ∈ N:

`1/3.5 + 1/5.7 + 1/7.9 + ...+ 1/((2n + 1)(2n +3)) = n/(3(2n +3))`

Prove the following by using the principle of mathematical induction for all n ∈ N: 10²ⁿ^{– 1}+ 1 is divisible by 11

Prove the following by using the principle of mathematical induction for all n ∈ N: x²ⁿ – y²ⁿ is divisible by x + y.

If P (n) is the statement "n² + n is even", and if P (r) is true, then P (r + 1) is true.

1 + 2 + 3 + ... + n = \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .

\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]

1 + 3 + 5 + ... + (2n − 1) = n² i.e., the sum of first n odd natural numbers is n².

\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]

1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]

1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]

1² + 3² + 5² + ... + (2n − 1)² = \[\frac{1}{3}n(4 n^2 - 1)\]

a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]

5²ⁿ −1 is divisible by 24 for all n ∈ N.

3²ⁿ+7 is divisible by 8 for all n ∈ N.

(ab)ⁿ = aⁿbⁿ for all n ∈ N.

2.7ⁿ + 3.5ⁿ − 5 is divisible by 24 for all n ∈ N.

\[\frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n\] is a positive integer for all n ∈ N.

\[\text{ Prove that } \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ for all n } \in N .\]