English

Define the sequence a1, a2, a3 ... as follows:a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2. Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the

Advertisements
Advertisements

Question

Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.

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

Sum
Advertisements

Solution

Let P(n) be the statement.

i.e., P(n): an = 2.5n–1 for all natural numbers,

We observe that P(1) is true,

Assume that P(n) is true for some natural number k

i.e., P(k): ak = 2.5k – 1.

Now to prove that P(k + 1) is true.

We have P(k + 1) : ak+1

= 5.ak

= 5.(2.5k – 1)

= 2.5k

= `2.5^((k + 1) - 1)`

Thus P(k + 1) is true whenever P(k) is true.

Hence, by the Principle of Mathematical Induction, P(n) is true for all natural numbers.

shaalaa.com
  Is there an error in this question or solution?
Chapter 4: Principle of Mathematical Induction - Solved Examples [Page 64]

APPEARS IN

NCERT Exemplar Mathematics [English] Class 11
Chapter 4 Principle of Mathematical Induction
Solved Examples | Q 6.(ii) | Page 64

Video TutorialsVIEW ALL [1]

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: 1.2.3 + 2.3.4 + … + n(n + 1) (n + 2)  = `(n(n+1)(n+2)(n+3))/(4(n+3))`


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


1 + 2 + 3 + ... + n =  \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .


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


\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]

 


\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\] 


2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]

 

a + ar + ar2 + ... + arn−1 =  \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]

 

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


Prove that n3 - 7+ 3 is divisible by 3 for all n \[\in\] N .

  

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

 

\[\frac{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^n}\tan\left( \frac{x}{2^n} \right) = \frac{1}{2^n}\cot\left( \frac{x}{2^n} \right) - \cot x\] for all n ∈ and  \[0 < x < \frac{\pi}{2}\]

 


\[1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + . . . + \frac{1}{n^2} < 2 - \frac{1}{n}\] for all n ≥ 2, 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{ Prove that }  \frac{1}{n + 1} + \frac{1}{n + 2} + . . . + \frac{1}{2n} > \frac{13}{24}, \text{ for all natural numbers } 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 by method of induction, for all n ∈ N:

2 + 4 + 6 + ..... + 2n = n (n+1)


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:

13 + 33 + 53 + .... to n terms = n2(2n2 − 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:

`(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:

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


Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`


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:

n3 – 7n + 3 is divisible by 3, for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

32n – 1 is divisible by 8, for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

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


Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.


Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.


If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.


Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×