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:
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:
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: 102n – 1 + 1 is divisible by 11
Prove the following by using the principle of mathematical induction for all n ∈ N: x2n – y2n is divisible by x + y.
Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.
Prove the following by using the principle of mathematical induction for all n ∈ N (2n +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.
Given an example of a statement P (n) such that it is true for all n ∈ N.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
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}\]
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\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} .\]
Show by the Principle of Mathematical induction that the sum Sn of then terms of the series \[1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + 2 \times 6^2 + 7^2 + . . .\] is given by \[S_n = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ if n is even} }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ if n is odd } }\]
\[\text{ A sequence } a_1 , a_2 , a_3 , . . . \text{ is defined by letting } a_1 = 3 \text{ and } a_k = 7 a_{k - 1} \text{ for all natural numbers } k \geq 2 . \text{ Show that } a_n = 3 \cdot 7^{n - 1} \text{ for all } n \in N .\]
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/(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, for all n ∈ N
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
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:
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 52n − 22n is divisible by 3, for all n ∈ N
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.
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"):}`
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:
2n < (n + 2)! for all natural number n.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
By using principle of mathematical induction for every natural number, (ab)n = ______.
