Advertisements
Advertisements
प्रश्न
Advertisements
उत्तर
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
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1^3 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^2`
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:
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: 32n + 2 – 8n– 9 is divisible by 8.
Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
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.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
32n+7 is divisible by 8 for all n ∈ N.
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ 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?\]
Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .
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:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
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
12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`
Answer the following:
Prove by method of induction loga xn = n logax, x > 0, 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.
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))`
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
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:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ N.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
