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 2 (Arts and Science) [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/1.2.3 + 1/2.3.4 + 1/3.4.5 + ...+ `1/(n(n+1)(n+2)) = (n(n+3))/(4(n+1) (n+2))`

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/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`

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

Given an example of a statement P (n) such that it is true for all n ∈ N.

Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer.

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

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}\]

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

1.2 + 2.2² + 3.2³ + ... + n.2ⁿ= (n − 1) 2ⁿ⁺¹+2

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

\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]

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

5²ⁿ⁺² −24n −25 is divisible by 576 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 .\]

\[\text{ Let } P\left( n \right) \text{ be the statement } : 2^n \geq 3n . \text{ If } P\left( r \right) \text{ is true, then show that } P\left( r + 1 \right) \text{ is true . Do you conclude that } P\left( n \right)\text{ is true for all n } \in N?\]

\[\text { A sequence } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and } x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that } x_n = \frac{2}{n!} \text{ for all } n \in N .\]

\[\text{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{ for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n } \in N \text{ using mathematical induction .} \]

\[\text{ Using principle of mathematical induction, prove that } \sqrt{n} < \frac{1}{\sqrt{1}} + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + . . . + \frac{1}{\sqrt{n}} \text{ for all natural numbers } n \geq 2 .\]

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

2 + 4 + 6 + ..... + 2n = n (n+1)

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

3 + 7 + 11 + ..... + to n terms = n(2n+1)

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

1² + 2² + 3² + .... + n² = `("n"("n" + 1)(2"n" + 1))/6`

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

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

Answer the following:

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

`1/(3.4.5) + 2/(4.5.6) + 3/(5.6.7) + ... + "n"/(("n" + 2)("n" + 3)("n" + 4)) = ("n"("n" + 1))/(6("n" + 3)("n" + 4))`

Answer the following:

Given that t_n+1 = 5t_n − 8, t₁ = 3, prove by method of induction that t_n = 5ⁿ⁻¹ + 2

Answer the following:

Prove by method of induction

`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`

Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 2.

Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.