Let $z_1, z_2,\dots,z_n \in \mathbb C$ such that $$z_1^k+\dots+z_n^k=0$$ for all integers $k\geq 2$. Then how to prove that $z_1=z_2=\dots=z_n=0$?
My try:
I got to work it for $n=2$ case, by using some brute force calulation. i.e. taking $z_j= r_j e^{i\theta_j}$ and solving further.
But for larger $n$ I don’t have any idea.
It seems like induction argument will work. Any hint?
With a slight generalization of copper.hat's solution to
one can proceed as follows:
Let $p(z) = \sum_{k=0}^N a_k z^k$ be a polynomial such that $p(0) = 0$, $ p'(0) = 0$, and $$ p(z_j) = |z_j| \quad \text{for } j = 1, \ldots, n \, . $$
Then $a_0=a_1=0$ and $$ \sum_{j=1}^n |z_j| = \sum_{j=1}^n p(z_j) = \sum_{k=2}^N a_k \sum_{j=1}^n z_j^k = 0 $$ and therefore $z_1 = \ldots = z_n = 0$.
Remark 1: The existence of such a polynomial $p$ can be shown with a slightly modified Langrange interpolation: Let $w_1, \ldots, w_m$ be the non-zero distinct values in $\{ z_1, \ldots, z_n \}$, and $$ L_j(z) = \prod_{\substack{l=1 \\ l \ne j}}^m \frac{z-w_l}{w_j-w_l} \quad (1 \le j \le m) $$ the corresponding Language polynomials. Then $$ p(z) = \sum_{j=1}^m |w_j|\frac{z^2}{w_j^2} L_j(z) \, . $$ has the desired properties.
Remark 2: The degree of $p$ is at most $m + 1 \le n+1$. Therefore it suffices to require that $ z_1^k+ \ldots +z_n^k=0$ for $2 \le k \le n+1$.