Can you prove this trig identity?

  • Thread starter Thread starter elimqiu
  • Start date Start date
  • Tags Tags
    Identity Trig
AI Thread Summary
The discussion focuses on proving the trigonometric identity involving the sum of sine and cotangent functions, specifically \(\sum_{k=1}^{n-1}\sin\frac{km\pi}{n}\cot\frac{k\pi}{2n} = n-m\). Participants suggest using Euler's formula as a starting point for the proof, but some express difficulty in handling the geometric sequence with double summation. The context of the question appears to be for mathematical exploration rather than homework, with one user questioning the relevance of the proof in academic settings. The conversation highlights a desire for deeper understanding and appreciation of the formula's beauty. Overall, the thread emphasizes the challenge and interest in proving this trigonometric identity.
elimqiu
Messages
11
Reaction score
0
Show that \displaystyle{\sum_{k=1}^{n-1}\sin\frac{km\pi}{n}\cot\frac{k\pi}{2n} = n-m}\quad\quad(m,n\in\mathbb{N}^+,\ m\le n)
 
Last edited:
Mathematics news on Phys.org
Why not start by applying the Euler formula

\cos \alpha= \frac{e^{i\alpha}+e^{-i\alpha}}{2},~\sin \alpha=\frac{e^{i\alpha}-e^{-i\alpha}}{2i}

What do you get then??
 
micromass said:
Why not start by applying the Euler formula
What do you get then??

Thanks micromass, not see real advantage yet...geometric sequence cannot be handled easily with double summation...
 
elimqiu said:
Show that \displaystyle{\sum_{k=1}^{n-1}\sin\frac{km\pi}{n}\cot\frac{k\pi}{2n} = n-m}\quad\quad(m,n\in\mathbb{N}^+,\ m\le n)

What is the context of the question? Is it for schoolwork?
 
berkeman said:
What is the context of the question? Is it for schoolwork?
It's a tool to prove

f(x)=a_1\sin x+\cdots+a_n\sin nx,\quad |f(x)|\le |\sin x|\quad (\forall x\in\mathbb{R})\implies |a_1+\cdots+a_n|\le 1

It's not fit for homework in any math course I guess:)
 
No one interested in a proof of such a pretty formula?
 

Similar threads

Back
Top