English

A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.

Advertisements
Advertisements

Question

A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.

Theorem
Advertisements

Solution

We have b0 = 5 and bk = 4 + bk – 1

⇒ b0 = 5, b1 = 4 + b0 = 4 + 5 = 9

And b2 = 4 + b1 = 4 + 9 = 13

Let P(n) : bn = 5 + 4n

Step 1: P(1) : b1 = 5 + 4 = 9 

⇒ 9 = 9 which is true.

Step 2: P(k): bk = 5 + 4k

Let it be true ∀ k ∈ N.

Step 3: Given that P(k) = 4 + bk – 1

⇒ P(k + 1) = 4 + bk+1–1

⇒ P(k + 1) = 4 + bk = 4 + 5 + 4k

⇒ P(k + 1) = 5 + 4(k + 1) which is true for P(k + 1).

Hence, P(k + 1) is true whenever P(k) is true.

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

APPEARS IN

NCERT Exemplar Mathematics Exemplar [English] Class 11
Chapter 4 Principle of Mathematical Induction
Exercise | Q 18 | Page 71

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

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 + 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+2+ 3+...+n<1/8(2n +1)^2`


Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.


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 "n2 + n is even", and if P (r) is true, then P (r + 1) is true.

 

If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not 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.


12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .

 

\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]


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

 

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}\]

 

52n −1 is divisible by 24 for all n ∈ N.


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

 

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

 

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

 

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

 


x2n−1 + y2n−1 is divisible by x + y for all n ∈ 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:

12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`


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

`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`


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

`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`


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

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


Answer the following:

Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N


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

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


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 the statement by using the Principle of Mathematical Induction:

23n – 1 is divisible by 7, for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

n3 – n is divisible by 6, for each natural number n ≥ 2.


Prove the statement by using the Principle of Mathematical Induction:

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


For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×