English

Sin X + Sin 3 X + . . . + Sin ( 2 N − 1 ) X = Sin 2 N X Sin X

Advertisements
Advertisements

Question

\[\sin x + \sin 3x + . . . + \sin (2n - 1)x = \frac{\sin^2 nx}{\sin x}\]

 

Advertisements

Solution

Let P(n) be the given statement.

\[P(n): \sin x + \sin 3x + . . . + \sin\left( 2n - 1 \right)x = \frac{\sin^2 nx}{\sin x}\]
\[\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 . \]
shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Mathematical Induction - Exercise 12.2 [Page 28]

APPEARS IN

R.D. Sharma Mathematics [English] Class 11
Chapter 12 Mathematical Induction
Exercise 12.2 | Q 39 | Page 28

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

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.3 + 3.5 + 5.7 + ...+(2n -1)(2n + 1) = `(n(4n^2 + 6n -1))/3`

Prove the following by using the principle of mathematical induction for all n ∈ N: 

`1/2.5 + 1/5.8 + 1/8.11 + ... + 1/((3n - 1)(3n + 2)) = n/(6n + 4)`

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: 

`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: 41n – 14n is a multiple of 27.


If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.

 

12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .

 

1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]

 

\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]


1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]

 

12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]

 

a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]

 


52n −1 is divisible by 24 for all n ∈ N.


72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.

 

11n+2 + 122n+1 is divisible by 133 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}\]

 

7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]

 

\[1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + . . . + \frac{1}{n^2} < 2 - \frac{1}{n}\] for all n ≥ 2, n ∈ 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 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`


Prove by method of induction, for all n ∈ N:

Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1


Answer the following:

Prove, by method of induction, for all n ∈ N

2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n 


Answer the following:

Prove, by method of induction, for all n ∈ N

`1/(3.4.5) + 2/(4.5.6) + 3/(5.6.7) + ... + "n"/(("n" + 2)("n" + 3)("n" + 4)) = ("n"("n" + 1))/(6("n" + 3)("n" + 4))`


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 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 


Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.

Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.


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"):}`


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 ≥ 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:

`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 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.


Prove the statement by using the Principle of Mathematical Induction:

1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×