Advertisements
Advertisements
Question
Advertisements
Solution
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
RELATED QUESTIONS
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/1.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`
Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.
If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is 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 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\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}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
52n −1 is divisible by 24 for all n ∈ N.
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ 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:
12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`
Prove by method of induction, for all n ∈ N:
(23n − 1) is divisible by 7
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
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 52n − 22n is divisible by 3, 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 ≥ 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:
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:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
