A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ N.

Given that: d1 = 2 and dk = `(d_(k - 1))/k` Let P(n): dn = `2/(n!)` Step 1: P(1) : d1 = `2/(1!)` = 2 which is true for P(1). Step 2: P(k) : dk = `2/(k!)`. Let it be true for P(k). Step 3: Given that: dk = `(d_(k - 1))/k` &there4; dk+1 = `(d_(k + 1 - 1))/(k + 1) = d_k/(k + 1)` ⇒ dk+1 = `1/(k + 1) . d_k = 1/(k + 1) . 2/(k!)` ⇒ dk+1 = `2/((k + 1)!)` Which is true for P(k + 1). Hence, P(k + 1) is true whenever P(k) is true.

A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = kdk-1k for all natural numbers, k ≥ 2. Show that dn = 2n! for all n ∈ N.

प्रश्न

A sequence d₁, d₂, d₃ ... is defined by letting d₁ = 2 and d_k = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that d_n = `2/(n!)` for all n ∈ N.

प्रमेय

उत्तर

Given that: d₁ = 2 and d_k = `(d_(k - 1))/k`

Let P(n): d_n = `2/(n!)`

Step 1: P(1) : d₁ = `2/(1!)` = 2 which is true for P(1).

Step 2: P(k) : d_k = `2/(k!)`. Let it be true for P(k).

Step 3: Given that: d_k = `(d_(k - 1))/k`

∴ d_k+1 = `(d_(k + 1 - 1))/(k + 1) = d_k/(k + 1)`

⇒ d_k+1 = `1/(k + 1) . d_k = 1/(k + 1) . 2/(k!)`

⇒ d_k+1 = `2/((k + 1)!)` Which is true for P(k + 1).

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

shaalaa.com

Principle of Mathematical Induction

क्या इस प्रश्न या उत्तर में कोई त्रुटि है?

Q 19 Q 18 Q 20

अध्याय 4: Principle of Mathematical Induction - Exercise [पृष्ठ ७१]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics Exemplar [English] Class 11

अध्याय 4 Principle of Mathematical Induction
Exercise | Q 19 | पृष्ठ ७१

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

view
वीडियो ट्यूटोरियल For All Subjects
Principle of Mathematical Induction

video tutorial00:17:42

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

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+ 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 + 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 + 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/3.5 + 1/5.7 + 1/7.9 + ...+ 1/((2n + 1)(2n +3)) = n/(3(2n +3))`

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

If P (n) is the statement "n² − 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.

1 + 3 + 3² + ... + 3ⁿ⁻¹ = \[\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}\]

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

1² + 3² + 5² + ... + (2n − 1)² = \[\frac{1}{3}n(4 n^2 - 1)\]

Prove that 1 + 2 + 2² + ... + 2ⁿ = 2ⁿ⁺¹ - 1 for all n \[\in\] 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 ∈ N and \[0 < x < \frac{\pi}{2}\]

x²ⁿ⁻¹ + y²ⁿ⁻¹ is divisible by x + y for all n ∈ N.

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

\[\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{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{ for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n } \in N \text{ using mathematical induction .} \]

\[\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/(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:

(2³ⁿ − 1) is divisible by 7

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

5 + 5² + 5³ + .... + 5ⁿ = `5/4(5^"n" - 1)`

Answer the following:

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

2 + 3.2 + 4.2² + ... + (n + 1)2^n–1 = n.2ⁿ

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

Answer the following:

Prove by method of induction

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

Answer the following:

Prove by method of induction log_a xⁿ = n log_ax, x > 0, n ∈ N

Define the sequence a₁, a₂, a₃ ... as follows:
a₁= 2, a_n = 5 a_n–1, for all natural numbers n ≥ 2.

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

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