Advertisements
Advertisements
प्रश्न
Advertisements
उत्तर
Let P(n) be the given statement.
\[\text{ Step } 1: \]
\[P(1): \sin x = \frac{\sin^2 x}{\sin x}\]
\[\text{ Thus, P(1) is true } . \]
\[\text{ Step 2: } \]
\[\text{ Let P(m) be true .} \]
\[ \therefore \sin x + \sin 3x + . . . + \sin\left( 2m - 1 \right)x = \frac{\sin^2 mx}{\sin x}\]
\[\text{ We shall show that P(m + 1) is true .} \]
\[\text{ We know that P(m) is true } . \]
\[ \therefore \sin x + \sin 3x + . . . + \sin (2m - 1) = \frac{\sin^2 mx}{\sin x}\]
\[ \Rightarrow \sin x + \sin 3x + . . . \sin (2m - 1)x + \sin (2m + 1)x = \frac{\sin^2 mx}{\sin x} + \sin (2m + 1)x \left( \text{ Adding } \sin (2m + 1)x \text{ to both the sides } \right)\]
\[ \Rightarrow P(m + 1)x = \frac{\sin^2 mx + \sin x\left[ \sin mx\cos\left( m + 1 \right)x + \sin\left( m + 1 \right)x \cos x \right]}{\sin x}\]
\[ = \frac{\sin^2 mx + \sin x\left( \sin mx\cos mxcos x - \sin^2 mx\sin x + \sin mx\cos x\cos mx + \cos^2 mx\sin x \right)}{\sin x}\]
\[ = \frac{\sin^2 mx + 2\sin x\cos x\cos mx - \sin^2 x \sin^2 mx + \cos^2 mx \sin^2 x}{\sin x}\]
\[ = \frac{\sin^2 mx\left( 1 - \sin^2 x \right) + 2\sin x\cos x\cos mx + \cos^2 mx \sin^2 x}{\sin x}\]
\[ = \frac{\sin^2 mx \cos^2 x + 2\sin x\cos x\cos mx + \cos^2 mx \sin^2 x}{\sin x}\]
\[ = \frac{\left( \sin mx \cos x + \cos mx \sin x \right)^2}{\sin x}\]
\[ = \frac{\left[ \sin\left( m + 1 \right) \right]^2}{\sin x}\]
\[\text{ [Hence, P(m + 1) is true } . \]
\[ \text{ By the principle of mathematical induction, the given statement P(n) is true for all } n \in N . \]
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 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/3]`
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:
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.
Prove the following by using the principle of mathematical induction for all n ∈ N (2n +7) < (n + 3)2
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
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.
\[\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?\]
\[\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:
2 + 4 + 6 + ..... + 2n = n (n+1)
Prove by method of induction, for all n ∈ N:
3n − 2n − 1 is divisible by 4
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
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:
1 + 3 + 5 + ... + (2n – 1) = n2
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.
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
Prove the statement by using the Principle of Mathematical Induction:
n3 – n is divisible by 6, for each natural number n ≥ 2.
Prove the statement by using the Principle of Mathematical Induction:
2n < (n + 2)! for all natural number n.
Prove the statement by using the Principle of Mathematical Induction:
`sqrt(n) < 1/sqrt(1) + 1/sqrt(2) + ... + 1/sqrt(n)`, for all natural numbers n ≥ 2.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
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.
