Answer the following: Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2

Question

Answer the following:

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

Sum

Solution

The statement P(n) has L.H.S. a recurrence relation t_n+1 = 5t_n – 8, t₁ = 3 and R.H.S. a general statement t_n = 5^n–1 + 2

Step I:

To prove P(1) is true.

L.H.S. = 3, R.H.S. = 5^1–1 + 2

= 1 + 2

= 3

So P(1) is true

∴ For n = 2, L.H.S = t₂ = 5t₁ – 8 = 5(3) – 8 = 7

R.H.S. = t₂ = 5^2–1 + 2

= 5 + 7

= 2

∴ P(2) is also true

Step II:

Assume P(k) is true

i.e. t_k+1 = 5t_k – 8 and t_k = 5^k–1 + 2

Step III:

To prove P(k + 1) is true

i.e. to prove t_k+1 = 5^k+1–1 + 2 = 5^k + 2

Since t_k+1 = 5t_k – 8 and t_k = 5^k–1 + 2 ......(from step II)

∴ t_k+1 = 5(5^k–1 + 2) – 8 = 5^k + 2

∴ P(k + 1) is true.

From all the steps above,

P(n) : t_n = 5^n–1 + 2 is true for all

n ∈ N where t_n+1 = 5t_n – 8, t₁ = 3.

shaalaa.com

Principle of Mathematical Induction

Is there an error in this question or solution?

Q II. (2)Q II. (1) (iv)Q II. (3)

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. (2) | Page 85

RELATED QUESTIONS

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

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

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

1.3 + 2.3^3 + 3.3^3 +...+ n.3^n = `((2n -1)3^(n+1) + 3)/4`

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:

`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 (2n +7) < (n + 3)²

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

If P (n) is the statement "n² − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.

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

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

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

11ⁿ⁺² + 12²ⁿ⁺¹ is divisible by 133 for all n ∈ N.

7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]

\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .

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

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{ A sequence } a_1 , a_2 , a_3 , . . . \text{ is defined by letting } a_1 = 3 \text{ and } a_k = 7 a_{k - 1} \text{ for all natural numbers } k \geq 2 . \text{ Show that } a_n = 3 \cdot 7^{n - 1} \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 .\]