Advertisements
Advertisements
Question
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
Solution
\[\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
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 + 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:
(1+3/1)(1+ 5/4)(1+7/9)...`(1 + ((2n + 1))/n^2) = (n + 1)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N:
`(1+ 1/1)(1+ 1/2)(1+ 1/3)...(1+ 1/n) = (n + 1)`
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: 32n + 2 – 8n– 9 is divisible by 8.
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
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.
1 + 2 + 3 + ... + n = \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]
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.
32n+7 is divisible by 8 for all n ∈ N.
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
Prove by method of induction, for all n ∈ N:
1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
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
2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n
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 52n − 22n is divisible by 3, for all n ∈ N
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
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"):}`
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
A student was asked to prove a statement P(n) by induction. He proved that P(k + 1) is true whenever P(k) is true for all k > 5 ∈ N and also that P(5) is true. On the basis of this he could conclude that P(n) is true ______.
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:
For any natural number n, 7n – 2n is divisible by 5.
Prove the statement by using the Principle of Mathematical Induction:
n3 – n is divisible by 6, for each natural number n ≥ 2.
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.
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.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
By using principle of mathematical induction for every natural number, (ab)n = ______.
