Let $v$ be any vector in the plane, and $\{w_i\}$ be $n>2$ vectors evenly spaced around the unit circle. Then it seems true that $$\sum_{i=1}^n (v\cdot w_i)^2 = k \|v\|^2$$ where $k$ is a constant independent of $v$. My intuition is that the left-hand side, as a function of the argument $\theta$ of $v$, has "too much symmetry" for its low frequency.
Is there some slick proof of this identity, using e.g. the algebraic structure of the $n$ roots of unity?
This is similar to Noble's answer but I wanted to highlight the geometric aspect of the problem a little more. First we note that $$v \cdot w_i = || v || \cos(\theta) $$ where $\theta$ is the angle between $v$ and $w_i$. Since $||v||^2$ is on both sides of the equation, we can assume $||v|| = 1$.
Now consider a unit vector $v$ and a regular polygon with $n$ sides centered at the origin. Connect the vertices of the polygon to the center. $v$ lies between two of the radii. Now going counter clockwise, $v$ makes the following angles with the $w_i:$ $$x, x + \frac{2 \pi}n, x + 2 \cdot \frac{2 \pi}n, \cdots, x + (n-1) \cdot \frac{2 \pi}n $$ for some $x$ as shown in the image at the bottom of the post.
Therefore, the sum that we want is $$ \sum_{k=0}^{n-1} \cos \left( x + k \, \frac{2 \pi}n \right)^2.$$
Using Euler's formula $\cos(t) = \frac{e^{it} + e^{-it}}2$, we have
\begin{align} \sum_{k=0}^{n-1} \cos \left( x + k \, \frac{2 \pi}n \right)^2 &= \frac{1}4 \sum_{k=0}^{n-1} \left(e^{2i\left(x + k\, \frac{2\pi}n \right)} + e^{-2i\left(x + k\, \frac{2\pi}n \right)} + 2\right) \\ &= \frac{n}2 + (e^{2ix} + e^{-2ix}) \sum_{k=0}^{n-1} \omega^k \end{align} where $\omega$ is a non trivial $n$th root of unity. Then we can easily calculate that $$ \sum_{k=0}^{n-1} \omega^k = \frac{\omega^n-1}{\omega - 1} = 0$$ which proves the claim for $k = \frac{n}2.$