Advertisements
Advertisements
प्रश्न
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)\] for n ≥ 2, where a > 0, A > 0.
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}\]
Advertisements
उत्तर
\[\text{ Let } : \]
\[P\left( n \right): \frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{n - 1}} \]
\[\text{ Step } I \]
\[P(1): \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{1 - 1}} (\text{ which is true } )\]
\[P(2): \left( \frac{a_2 - \sqrt{A}}{a_2 + \sqrt{A}} \right) = \left( \frac{\frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) - \sqrt{A}}{\frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) + \sqrt{A}} \right) = \left( \frac{a_1 + \frac{A}{a_1} - 2\sqrt{A}}{a_1 + \frac{A}{a_1} + 2\sqrt{A}} \right) = \left( \frac{a_1 + A - 2\sqrt{A}}{a_1 + A + 2\sqrt{A}} \right) = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{2 - 1}} \]
\[\text{ Thus, P(1) and P(2) are true } . \]
\[\text{ Step } II \]
\[\text{ Let P(k) be true } . \]
\[\text{ Now, } \]
\[\frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{k - 1}} . . . . . (i)\]
\[\text{ and } \]
\[P(k + 1): \frac{a_{k + 1} - \sqrt{A}}{a_{k + 1} + \sqrt{A}} = \frac{\frac{1}{2}\left( a_k + \frac{A}{a_k} \right) - \sqrt{A}}{\frac{1}{2}\left( a_k + \frac{A}{a_k} \right) + \sqrt{A}}\]
\[ = \frac{\left( a_k + \frac{A}{a_k} \right) - 2\sqrt{A}}{\left( a_k + \frac{A}{a_k} \right) + 2\sqrt{A}}\]
\[ = \frac{\left( \sqrt{a_k} - \sqrt{\frac{A}{a_k}} \right)^2}{\left( \sqrt{a_k} + \sqrt{\frac{A}{a_k}} \right)^2}\]
\[ = \left( \frac{\sqrt{a_k} - \sqrt{\frac{A}{a_k}}}{\sqrt{a_k} + \sqrt{\frac{A}{a_k}}} \right)^2 \]
\[ = \left( \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} \right)^2 \]
\[ = \left[ \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{k - 1}} \right]^2 \]
\[ = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^k} \]
\[ = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^\left( k + 1 \right) - 1} \]
\[\text{ Thus, P(k + 1) is also true .} \]
\[= \frac{a_k \left( a_k + \sqrt{A} \right) \left( \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} \right)^{2^{k - 1}} - \sqrt{A}\left( a_k - \sqrt{A} \right)}{\left( a_k + \sqrt{A} \right)^2}\]
\[ = \frac{a_k \left( a_k + \sqrt{A} \right) \left( \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} \right)^{2^{k - 1}} - \sqrt{A}\left( a_k + \sqrt{A} \right) \left( \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} \right)^{2^{k - 1}}}{\left( a_k + \sqrt{A} \right)^2} \left[ \text{ Using } (i) \right]\]
\[ = \frac{\left( a_k + \sqrt{A} \right) \left( \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} \right)^{2^{k - 1}} \left( a_k - \sqrt{A} \right)}{\left( a_k + \sqrt{A} \right)^2}\]
\[ = \frac{\left( \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} \right)^{2^{k - 1}} \left( a_k - \sqrt{A} \right)}{\left( a_k + \sqrt{A} \right)}\]
\[ = \left( \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} \right)^{2^{k - 1}} \left( \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} \right)\]
\[ = \left( \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} \right)^\left( 2^{k - 1} + 1 \right) \]
\[ = \left( \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{k - 1}} \right)^\left( 2^{k - 1} + 1 \right) \]
APPEARS IN
संबंधित प्रश्न
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:
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N: n (n + 1) (n + 5) is a multiple of 3.
Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11
Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
Given an example of a statement P (n) such that it is true for all n ∈ N.
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.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
(ab)n = anbn 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?
\[\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{ 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 .} \]
Prove by method of induction, for all n ∈ N:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
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)`
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, for all n ∈ N
12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`
Answer the following:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
Answer the following:
Prove by method of induction loga xn = n logax, x > 0, n ∈ N
Answer the following:
Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N
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:
For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.
Prove the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
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.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
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.
