English

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

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

 

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


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


1.2 + 2.22 + 3.23 + ... + n.2= (n − 1) 2n+1+2

 

1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]

 

a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]

 


(ab)n = anbn for all n ∈ N. 

 

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


11n+2 + 122n+1 is divisible by 133 for all n ∈ N.

 

\[\frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n\] is a positive integer for all n ∈ N

 


Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ N


x2n−1 + y2n−1 is divisible by x + y 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{ 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{ 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?\]


Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .

 

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:

5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`


Answer the following:

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

12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`


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

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


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


Give an example of a statement P(n) which is true for all n. Justify your answer. 


Prove the statement by using the Principle of Mathematical Induction:

For any natural number n, 7n – 2n is divisible by 5.


Prove the statement by using the Principle of Mathematical Induction:

2n < (n + 2)! for all natural number n.


Prove the statement by using the Principle of Mathematical Induction:

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


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


If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.


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.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×