Advertisements
Advertisements
Question
\[\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} .\]
Advertisements
Solution
\[\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{ To prove: } \frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{n - 1}} \]
\[\text{ Proof: } \]
\[\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: For } n = 1, \]
\[LHS = \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}}\]
\[RHS = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{1 - 1}} = \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}}\]
\[\text{ As, LHS = RHS } \]
\[\text{ So, it is true for n } = 1 . \]
\[\text{ Step II: For n } = k, \]
\[\text{ Let } p\left( k \right): \frac{a_k - \sqrt{A}}{a_k + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{k - 1}} \text{ be true for some values of k } \geq 2 . \]
\[\text{ Step III: For } n = k + 1, \]
\[p\left( k + 1 \right): \]
\[LHS = \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{\frac{1}{2}\left( \frac{{a_k}^2 + A - 2 a_k \sqrt{A}}{a_k} \right)}{\frac{1}{2}\left( \frac{{a_k}^2 + A + 2 a_k \sqrt{A}}{a_k} \right)}\]
\[ = \frac{{a_k}^2 + A - 2 a_k \sqrt{A}}{{a_k}^2 + A + 2 a_k \sqrt{A}}\]
\[ = \frac{\left( a_k - \sqrt{A} \right)^2}{\left( a_k + \sqrt{A} \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( \text { Using step } II \right)\]
\[ = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{k - 1} \times 2} \]
\[ = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{k - 1 + 1}} \]
\[ = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^k} \]
\[RHS = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{k + 1 - 1}} \]
\[ = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^k} \]
\[As, LHS = RHS\]
\[\text{ So, it is also true for n } = k + 1 . \]
\[\text{ Hence, } \frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right)^{2^{n - 1}} .\]
APPEARS IN
RELATED QUESTIONS
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1 + 3 + 3^2 + ... + 3^(n – 1) =((3^n -1))/2`
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 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2
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:
`(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:
Prove the following by using the principle of mathematical induction for all n ∈ N: n (n + 1) (n + 5) is a multiple of 3.
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.
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}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
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}\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] N .
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.
\[\text{ Let } P\left( n \right) \text{ be the statement } : 2^n \geq 3n . \text{ If } P\left( r \right) \text{ is true, then show that } P\left( r + 1 \right) \text{ is true . Do you conclude that } P\left( n \right)\text{ is true for all n } \in N?\]
\[\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 .\]
\[\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 .\]
Prove by method of induction, for all n ∈ N:
12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
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 152n–1 + 1 is divisible by 16, 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.
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"):}`
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
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.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
