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:
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
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 + 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 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
32n+7 is divisible by 8 for all n ∈ N.
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] N .
x2n−1 + y2n−1 is divisible by x + y for all n ∈ 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:
12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
Answer the following:
Prove, by method of induction, for all n ∈ N
2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 2.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.
Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.
Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`
Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
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:
4n – 1 is divisible by 3, for each natural number n.
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, 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:
n(n2 + 5) is divisible by 6, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
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 for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
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 = ______.
