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:
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 + 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 (2n +7) < (n + 3)2
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
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{ The distributive law from algebra states that for all real numbers} c, a_1 \text{ and } a_2 , \text{ we have } c\left( a_1 + a_2 \right) = c a_1 + c a_2 . \]
\[\text{ Use this law and mathematical induction to prove that, for all natural numbers, } n \geq 2, if c, a_1 , a_2 , . . . , a_n \text{ are any real numbers, then } \]
\[c\left( a_1 + a_2 + . . . + a_n \right) = c a_1 + c a_2 + . . . + c a_n\]
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
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 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 statement by using the Principle of Mathematical Induction for all n ∈ N, that:
2n + 1 < 2n, for all natual numbers n ≥ 3.
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
Prove the statement by using the Principle of Mathematical Induction:
n(n2 + 5) is divisible by 6, for each natural number n.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
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.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
