trigonometry - Sum of powers of primitive root of unity- Trig Proof

I'm trying to prove that if $z=\operatorname{cis}(2\pi/n) = \cos(2\pi/n) + i\sin(2\pi/n)$, that is, $z$ is a primitive $n$-th root of unity, for any integer $n\geq 2$, $1+z+z^2+\cdots+z^{n-1}=0$. I've already come across a nice and concise proof here, and that same link also has a comment pointing out that it's just a geometric sum which can be expressed as $\dfrac{1-\operatorname{cis}^n(2\pi/n)}{1-\operatorname{cis}(2\pi/n)}$ which is just $0$ in the numerator. However, I was wondering if I could do it just using trig functions. It's an inefficient way of proving it, but I was fixated on this approach for so long I was wondering if someone knew how to do it.

Proving that the imaginary part is $0$ is easy- you just use the identity $\sin(a)+\sin(b)=2\sin(\frac{a+b}{2})\sin(\frac{a-b}{2})$ and for each integer $j$ where $0< j

This same approach doesn't work for the real part- using the identity $\cos(a)+ \cos(b) =2\cos(\frac{a+b}{2})\cos(\frac{a-b}{2})$, and adding the same pairs gets $2\cos(2\pi)\cos(2\pi(n-2j)/n)=2\cos(2\pi(n-2j)/n)$ so this gets $1+2\sum_{j=1}^{\lfloor n/2 \rfloor}\cos(2\pi(n-2j)/n)$ with $\cos(\pi/n)=-1$ added if $n$ is even. Then I need to show that that sum is $0$ if $n$ is even and $-1/2$ if $n$ is odd. Is there a clean way of doing this? The only thing I can think to do is repeat the sum of $\cos$ identity, and that doesn't seem too helpful.

Answer

Use the identity $$\displaystyle\sum\limits_{m=0}^{n-1} \cos(mx+y)=\frac{\cos\left(\dfrac{n-1}{2}x+y\right)\sin\left(\dfrac{n}{2}\, x\right)}{\sin\left(\dfrac{x}{2}\right)}$$

and evaluate where $x=2\pi/n$ and $y=0$ to deduce that the real part is zero.