English

Maharashtra State BoardHSC Science (General) 11th Standard

Question Papers

Question Papers

Textbook Solutions9077

MCQ Online Mock Tests

Important Solutions

Concept Notes & Videos620

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

Advertisements

Advertisements

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

Advertisements

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

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

1.3 + 3.5 + 5.7 + ...+(2n -1)(2n + 1) = `(n(4n^2 + 6n -1))/3`

Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2 + 2.2² + 3.2² + … + n.2ⁿ = (n – 1) 2ⁿ⁺¹ + 2

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

`1/2.5 + 1/5.8 + 1/8.11 + ... + 1/((3n - 1)(3n + 2)) = n/(6n + 4)`

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: x²ⁿ – y²ⁿ is divisible by x + y.

Prove the following by using the principle of mathematical induction for all n ∈ N: 3²ⁿ^{+ 2} – 8n– 9 is divisible by 8.

If P (n) is the statement "n(n + 1) is even", then what is P(3)?

If P (n) is the statement "2ⁿ ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.

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 + 3 + 3² + ... + 3ⁿ⁻¹ = \[\frac{3^n - 1}{2}\]

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 + ar + ar² + ... + arⁿ⁻¹ = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]

7²ⁿ + 2³ⁿ⁻³. 3ⁿ⁻¹ is divisible by 25 for all n ∈ N.

Prove that 1 + 2 + 2² + ... + 2ⁿ = 2ⁿ⁺¹ - 1 for all n \[\in\] N .

Show by the Principle of Mathematical induction that the sum S_n of then terms of the series \[1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + 2 \times 6^2 + 7^2 + . . .\] is given by \[S_n = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ if n is even} }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ if n is odd } }\]

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

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

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

5 + 5² + 5³ + .... + 5ⁿ = `5/4(5^"n" - 1)`

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

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

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

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

2n + 1 < 2ⁿ, for all natual numbers n ≥ 3.

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 ______.

State whether the following proof (by mathematical induction) is true or false for the statement.

P(n): 1² + 2² + ... + n² = `(n(n + 1) (2n + 1))/6`

Proof By the Principle of Mathematical induction, P(n) is true for n = 1,

1² = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k² = `(k(k + 1)(2k + 1))/6`. Now we prove that

(k + 1)² = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`

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

Prove the statement by using the Principle of Mathematical Induction:

1 + 2 + 2² + ... + 2ⁿ = 2ⁿ⁺¹ – 1 for all natural numbers n.

Prove the statement by using the Principle of Mathematical Induction:

1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.

A sequence b₀, b₁, b₂ ... is defined by letting b₀ = 5 and b_k = 4 + b_{k – 1} for all natural numbers k. Show that b_n = 5 + 4n for all natural number n using mathematical induction.

A sequence d₁, d₂, d₃ ... is defined by letting d₁ = 2 and d_k = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that d_n = `2/(n!)` for all n ∈ N.

Prove that number of subsets of a set containing n distinct elements is 2ⁿ, for all n ∈ N.

If 10ⁿ + 3.4ⁿ⁺² + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.

By using principle of mathematical induction for every natural number, (ab)ⁿ = ______.

Notifications