Question 158
Let $n$ and $k$ be natural numbers, where $1 \le k \lt n$. At each vertex of a regular polygon with $n$ sides, either $1$ or $-1$ is written. At each step, we choose $k$ consecutive vertices and change their signs. Is it possible, starting from any configuration and performing this transformation multiple times, to obtain any other configuration?