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.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:
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that 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}\] .
\[\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.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}\]
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
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)\] for n ≥ 2, where a > 0, A > 0.
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 .
\[\text{ A sequence } a_1 , a_2 , a_3 , . . . \text{ is defined by letting } a_1 = 3 \text{ and } a_k = 7 a_{k - 1} \text{ for all natural numbers } k \geq 2 . \text{ Show that } a_n = 3 \cdot 7^{n - 1} \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:
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)
Prove by method of induction, for all n ∈ N:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
Prove by method of induction, for all n ∈ N:
(23n − 1) is divisible by 7
Answer the following:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
Answer the following:
Prove by method of induction
`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "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:
`(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:
2n + 1 < 2n, for all natual numbers n ≥ 3.
Give an example of a statement P(n) which is true for all n. Justify your answer.
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:
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:
2n < (n + 2)! for all natural number 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 `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
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.
