In this post, Alexandre Eremenko outlines a method to find solutions to systems of equations of the form:
$$\begin{cases} \sum_i x_i = c_1 \\ \;\vdots \\ \sum_i x_i^n = c_n \end{cases}$$
I tried this method, but ended up with a wrong result. Suppose I have:
$$\begin{cases} x_1 + x_2 = 1 \\ x_1^2 + x_2^2 = 3\end{cases}$$
In the language of the Wikipedia article linked in the post, this is $p_1 = 1$ and $p_2 = 3$. Thus if $e_i$ is the $i$th elementary symmetric polynomial, we know that $e_1 = 1$ and $2e_2 = p_1^2 - p_2 = -2$, thus:
$$\begin{cases} e_1 = 1 \\ e_2 = -1 \end{cases}$$
According to Alexandre, the solutions $(x_1,x_2)$ are roots of the polynomial:
$$x^2 + x - 1$$
but these roots are in fact $(-\varphi,-\phi)$ (where $\varphi$ is the golden ratio and $\phi$ its conjugate), when the answer should be $(\varphi,\phi)$. What went wrong?