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 + 3^2 + ... + 3^(n – 1) =((3^n -1))/2`
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.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2
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:
(1+3/1)(1+ 5/4)(1+7/9)...`(1 + ((2n + 1))/n^2) = (n + 1)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N:
Given an example of a statement P (n) such that it is true for all n ∈ N.
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.
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.
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
(ab)n = anbn for all n ∈ N.
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.
Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ 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:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
Prove by method of induction, for all n ∈ N:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
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:
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"`
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 ______.
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:
n(n2 + 5) is divisible by 6, for each natural number n.
A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.
Prove that for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.
Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.
If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.
Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?
