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 + 3^2 + ... + 3^(n – 1) =((3^n -1))/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: `1+2+ 3+...+n<1/8(2n +1)^2`
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 "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not 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}\] .
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
\[\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} .\]
\[\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:
2 + 4 + 6 + ..... + 2n = n (n+1)
Prove by method of induction, for all n ∈ N:
1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (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 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:
`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, 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.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
2n + 1 < 2n, for all natual numbers n ≥ 3.
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"):}`
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:
4n – 1 is divisible by 3, for each natural number 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:
n2 < 2n for all natural numbers n ≥ 5.
Prove the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 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.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, for all n ∈ N.
If 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
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.
