English

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

Advertisements
Advertisements

Question

Answer the following:

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

Sum
Advertisements

Solution

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

Step I:

To prove P(1) is true.

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

= 1 + 2

= 3

So P(1) is true

∴ For n = 2, L.H.S = t2 = 5t1 – 8 = 5(3) – 8 = 7

R.H.S. = t2 = 52–1 + 2

= 5 + 7

= 2

∴ P(2) is also true

Step II:

Assume P(k) is true

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

Step III:

To prove P(k + 1) is true

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

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

∴ tk+1 = 5(5k–1 + 2) – 8 = 5k + 2

∴ P(k + 1) is true.

From all the steps above,

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

n ∈ N where tn+1 = 5tn – 8, t1 = 3.

shaalaa.com
  Is there an error in this question or solution?
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 + 3^2 + ... + 3^(n – 1) =((3^n -1))/2`


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

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.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.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 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: 102n – 1 + 1 is divisible by 11


Prove the following by using the principle of mathematical induction for all n ∈ N (2+7) < (n + 3)2


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

 

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

 

52n+2 −24n −25 is divisible by 576 for all n ∈ N.

 

n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.

 

72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.

 

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


Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all \[\in\] N .

 

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

 


\[\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 .\]


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

(23n − 1) is divisible by 7


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

3n − 2n − 1 is divisible by 4


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

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


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

Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1


Answer the following:

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

8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`


Answer the following:

Prove by method of induction

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


The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.

Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.


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


Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.


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:

For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.


Prove the statement by using the Principle of Mathematical Induction:

`sqrt(n) < 1/sqrt(1) + 1/sqrt(2) + ... + 1/sqrt(n)`, for all natural numbers n ≥ 2.


Prove the statement by using the Principle of Mathematical Induction:

2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.


A sequence a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.


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


State whether the following statement is true or false. Justify.

Let P(n) be a statement and let P(k) ⇒ P(k + 1), for some natural number k, then P(n) is true for all n ∈ N.


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×