Use the Principle of Mathematical Induction to prove that for all $n \in N$:
$\sin \theta + \sin 2\theta + \ldots + \sin n\theta = \frac{\sin \frac{n\theta}{2} \sin \frac{(n+1)\theta}{2}}{\sin \frac{\theta}{2}}$

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) $P(n): \sin \theta + \sin 2\theta + \ldots + \sin n\theta = \frac{\sin \frac{n\theta}{2} \sin \frac{(n+1)\theta}{2}}{\sin \frac{\theta}{2}}, n \in N$
For $n=1$,$L.H.S. = \sin \theta$.
$R.H.S. = \frac{\sin \frac{\theta}{2} \sin \frac{2\theta}{2}}{\sin \frac{\theta}{2}} = \sin \theta$.
Since $L.H.S. = R.H.S.$,$P(1)$ is true.
Assume $P(k)$ is true for some $k \in N$:
$\sin \theta + \sin 2\theta + \ldots + \sin k\theta = \frac{\sin \frac{k\theta}{2} \sin \frac{(k+1)\theta}{2}}{\sin \frac{\theta}{2}}$.
For $n=k+1$,$L.H.S. = (\sin \theta + \ldots + \sin k\theta) + \sin(k+1)\theta$
$= \frac{\sin \frac{k\theta}{2} \sin \frac{(k+1)\theta}{2}}{\sin \frac{\theta}{2}} + \sin(k+1)\theta$
$= \frac{\sin \frac{k\theta}{2} \sin \frac{(k+1)\theta}{2} + \sin(k+1)\theta \sin \frac{\theta}{2}}{\sin \frac{\theta}{2}}$
Using $2\sin A \sin B = \cos(A-B) - \cos(A+B)$:
$= \frac{\frac{1}{2} [\cos(\frac{k\theta}{2} - \frac{(k+1)\theta}{2}) - \cos(\frac{k\theta}{2} + \frac{(k+1)\theta}{2})] + \frac{1}{2} [\cos((k+1)\theta - \frac{\theta}{2}) - \cos((k+1)\theta + \frac{\theta}{2})]}{\sin \frac{\theta}{2}}$
$= \frac{\cos \frac{\theta}{2} - \cos \frac{(2k+1)\theta}{2} + \cos \frac{(2k+1)\theta}{2} - \cos \frac{(2k+3)\theta}{2}}{2 \sin \frac{\theta}{2}}$
$= \frac{\cos \frac{\theta}{2} - \cos \frac{(2k+3)\theta}{2}}{2 \sin \frac{\theta}{2}}$
Using $\cos C - \cos D = 2 \sin \frac{C+D}{2} \sin \frac{D-C}{2}$:
$= \frac{2 \sin \frac{(k+2)\theta}{2} \sin \frac{(k+1)\theta}{2}}{2 \sin \frac{\theta}{2}} = \frac{\sin \frac{(k+1)\theta}{2} \sin \frac{(k+2)\theta}{2}}{\sin \frac{\theta}{2}} = R.H.S.$
Thus,$P(k+1)$ is true. By the Principle of Mathematical Induction,$P(n)$ is true for all $n \in N$.

Explore More

Similar Questions

The statement $P(n): 1 \times 1! + 2 \times 2! + 3 \times 3! + \dots + n \times n! = (n + 1)! - 1$ is

Prove the following by using the principle of mathematical induction for all $n \in N$:
$1 \cdot 3 + 2 \cdot 3^{2} + 3 \cdot 3^{3} + \ldots + n \cdot 3^{n} = \frac{(2n - 1) 3^{n+1} + 3}{4}$

Difficult
View Solution

If $P(n) = 2 + 4 + 6 + \dots + 2n$,$n \in N$,then $P(k) = k(k + 1) + 2 \implies P(k + 1) = (k + 1)(k + 2) + 2$ for all $k \in N$. So we can conclude that $P(k) = k(k + 1) + 2$ for all $k \in N$ is true. What can we conclude about $P(n) = n(n + 1) + 2$ for all $n \in N$?

Prove the statement by the Principle of Mathematical Induction:
$2n < (n+2)!$ for all natural numbers $n$.

Prove that $2^n > n$ for all positive integers $n$.

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo