I recently came across the following trigonometric identity in a test: $$ \bigl[n \csc(nx)\bigr]^2 = \sum_{k=0}^{n-1} \bigl[\csc(x+ k \pi/n) \bigr]^2 $$ The question was to prove the result for any natural number $n$.
What would be a good way to approach this problem?
My initial line of thought was that since $(\csc x)^2$ is the negative of the derivative of $\cot x$, the sum of the above series could be evaluated by differentiating a series involving the cotangent. Hence the question is equivalent to showing that : $$ n \cot(nx) = \sum_{k=0}^{n-1} \cot(x+ k \pi/n) $$ Taking the derivative of both sides with respect to the variable $x$ and multiplying the resulting equation by $-1$, we arrive at the required result. Although this does look simpler, I couldn't find a way to calculate the new sum. Could logarithms be used for this?
Does this method work on further simplification? Or is there an alternative route to the answer (involving, for instance, complex numbers)?
EDIT:
It turns out that the method does indeed work, as explained in this answer, where the second summation has been calculated using basic trigonometric expansions and a bit of algebra. Nevertheless, is there a different way to prove the identity without using calculus? Or even better(ideally), from trigonometry alone? Invoking calculus in a trig problem of this sort seems a tad unnatural, unintuitive and unappealing to me.