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

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

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

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))`

If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.

1 + 3 + 3² + ... + 3ⁿ⁻¹ = \[\frac{3^n - 1}{2}\]

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.2 + 2.2² + 3.2³ + ... + n.2ⁿ= (n − 1) 2ⁿ⁺¹+2

a + ar + ar² + ... + arⁿ⁻¹ = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]

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

\[1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + . . . + \frac{1}{n^2} < 2 - \frac{1}{n}\] for all n ≥ 2, n ∈ N

\[\sin x + \sin 3x + . . . + \sin (2n - 1)x = \frac{\sin^2 nx}{\sin x}\]

\[\text{ Given } a_1 = \frac{1}{2}\left( a_0 + \frac{A}{a_0} \right), a_2 = \frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) \text{ and } a_{n + 1} = \frac{1}{2}\left( a_n + \frac{A}{a_n} \right) \text{ for } n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ Prove that } \frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) 2^{n - 1} .\]

\[\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{ 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:

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

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

3ⁿ − 2n − 1 is divisible by 4

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

(cos θ + i sin θ)ⁿ = cos (nθ) + i sin (nθ)

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 15^2n–1 + 1 is divisible by 16, for all n ∈ N.

Answer the following:

Prove by method of induction 5²ⁿ − 2²ⁿ is divisible by 3, for all 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 statement by using the Principle of Mathematical Induction for all n ∈ N, that:

2²ⁿ – 1 is divisible by 3.

Define the sequence a₁, a₂, a₃ ... as follows:
a₁= 2, a_n = 5 a_n–1, for all natural numbers n ≥ 2.

Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula a_n = 2.5^n–1 for all natural numbers.

The distributive law from algebra says that for all real numbers c, a₁ and a₂, we have c(a₁ + a₂) = ca₁ + ca₂.

Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a₁, a₂, ..., a_n are any real numbers, then c(a₁ + a₂ + ... + a_n) = ca₁ + ca₂ + ... + ca_n.

Show by the Principle of Mathematical Induction that the sum S_n of the n term of the series 1² + 2 × 2² + 3² + 2 × 4² + 5² + 2 × 6² ... is given by

S_n = `{{:((n(n + 1)^2)/2",", "if n is even"),((n^2(n + 1))/2",", "if n is odd"):}`

A student was asked to prove a statement P(n) by induction. He proved that P(k + 1) is true whenever P(k) is true for all k > 5 ∈ N and also that P(5) is true. On the basis of this he could conclude that P(n) is true ______.