Advertisements
Advertisements
Question
Advertisements
Solution
We need to prove \[\frac{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^n}\tan\left( \frac{x}{2^n} \right) = \frac{1}{2^n}\cot\left( \frac{x}{2^n} \right) - \cot x\] for all n ∈ N and \[0 < x < \frac{\pi}{2}\] using mathematical induction.
For n = 1,
LHS = \[\frac{1}{2}\tan\frac{x}{2}\] and
\[RHS = \frac{1}{2}\cot\frac{x}{2} - \cot x = \frac{1}{2\tan\frac{x}{2}} - \frac{1}{\tan x}\]
\[ \Rightarrow RHS = \frac{1}{2\tan\frac{x}{2}} - \frac{1}{\frac{2\tan\frac{x}{2}}{1 - \tan^2 \frac{x}{2}}}\]
\[ \Rightarrow RHS = \frac{1}{2\tan\frac{x}{2}} - \frac{1 - \tan^2 \frac{x}{2}}{2 \tan\frac{x}{2}} = \frac{1 - 1 + \tan^2 \frac{x}{2}}{2\tan\frac{x}{2}} = \frac{\tan\frac{x}{2}}{2}\]
Therefore, the given relation is true for n = 1.
Now, let the given relation be true for n = k.
We need to prove that the given relation is true for n = k + 1.
\[\Rightarrow L = \frac{1}{2^k}\cot\left( \frac{x}{2^k} \right) + \frac{1}{2^{k + 1}}\tan\left( \frac{x}{2^{k + 1}} \right) - \cot x\]
\[ \Rightarrow L = \frac{1}{2^k \tan\left( \frac{x}{2^k} \right)} + \frac{1}{2^{k + 1}}\tan\left( \frac{x}{2^{k + 1}} \right) - \cot x\]
\[ \Rightarrow L = \frac{1}{2^k \tan2\left( \frac{x}{2^{k + 1}} \right)} + \frac{1}{2^{k + 1}}\tan\left( \frac{x}{2^{k + 1}} \right) - \cot x\]
\[ \Rightarrow L = \frac{1}{2^k \times \frac{2\tan\left( \frac{x}{2^{k + 1}} \right)}{1 - \tan^2 \left( \frac{x}{2^{k + 1}} \right)}} + \frac{1}{2^{k + 1}}\tan\left( \frac{x}{2^{k + 1}} \right) - \cot x\]
\[ \Rightarrow L = \frac{1 - \tan^2 \left( \frac{x}{2^{k + 1}} \right)}{2^{k + 1} \tan\left( \frac{x}{2^{k + 1}} \right)} + \frac{1}{2^{k + 1}}\tan\left( \frac{x}{2^{k + 1}} \right) - \cot x\]
\[\Rightarrow L = \frac{1 - \tan^2 \left( \frac{x}{2^{k + 1}} \right) + \tan^2 \left( \frac{x}{2^{k + 1}} \right)}{2^{k + 1} \tan\left( \frac{x}{2^{k + 1}} \right)} - \cot x = \frac{1}{2^{k + 1}}\cot\left( \frac{x}{2^{k + 1}} \right) - \cot x\]
Now,
\[\frac{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^k}\tan\left( \frac{x}{2^k} \right) + \frac{1}{2^{k + 1}}\tan\left( \frac{x}{2^{k + 1}} \right) = \frac{1}{2^{k + 1}}\cot\left( \frac{x}{2^{k + 1}} \right) - \cot x\]
Thus,
\[\frac{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^n}\tan\left( \frac{x}{2^n} \right) = \frac{1}{2^n}\cot\left( \frac{x}{2^n} \right) - \cot x\] for all n ∈ N and \[0 < x < \frac{\pi}{2}\]
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.22 + 3.22 + … + n.2n = (n – 1) 2n+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+ 3+...+n<1/8(2n +1)^2`
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.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
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}\]
32n+7 is divisible by 8 for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 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 .
\[\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:
2 + 4 + 6 + ..... + 2n = n (n+1)
Prove by method of induction, for all n ∈ N:
(24n−1) is divisible by 15
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
`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "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.
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.
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"):}`
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 ______.
State whether the following proof (by mathematical induction) is true or false for the statement.
P(n): 12 + 22 + ... + n2 = `(n(n + 1) (2n + 1))/6`
Proof By the Principle of Mathematical induction, P(n) is true for n = 1,
12 = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k2 = `(k(k + 1)(2k + 1))/6`. Now we prove that
(k + 1)2 = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`
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
Prove the statement by using the Principle of Mathematical Induction:
n3 – n is divisible by 6, for each natural number n ≥ 2.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
