मराठी

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

Advertisements
Advertisements

प्रश्न

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

उत्तर

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
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 4: Principle of Mathematical Induction - Exercise [पृष्ठ ७१]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics [English] Class 11
पाठ 4 Principle of Mathematical Induction
Exercise | Q 18 | पृष्ठ ७१

व्हिडिओ ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्‍न

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 + 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: 32n + 2 – 8n– 9 is divisible by 8.


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

 

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.


1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]

 

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


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


32n+2 −8n − 9 is divisible by 8 for all n ∈ N.


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

 

\[\frac{n^7}{7} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{n^2}{2} - \frac{37}{210}n\] is a positive integer for all n ∈ N.  

 


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

 


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


\[\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{ 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 { A sequence  } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and }  x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that }  x_n = \frac{2}{n!} \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 .\]

 


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))`


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 loga xn = n logax, x > 0, n ∈ N


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

`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2.


Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by

Sn = `{{:((n(n + 1)^2)/2",",  "if n is even"),((n^2(n + 1))/2",",  "if n is odd"):}`


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:

32n – 1 is divisible by 8, 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:

n2 < 2n for all natural numbers n ≥ 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:

2 + 4 + 6 + ... + 2n = n2 + n 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, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin  ((n + 1))/2 theta)/(sin  theta/2)`, for all n ∈ N.


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


Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ 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 P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×