I'm trying to do an exercise relative to symmetrical polynomials.
We're given the following polynomial:
$ X^3 + pX +q = 0$
With $x_1, x_2, x_3 $ its roots.
We're asked to give an expression with $p, q$ of the following sum :
$x_1^8 + x_2^8 + x_3^8 $
The obvious way to do this is way to messy, but I recall our teacher saying there was a trick when working with high exponents like these ones.
Please notice that this expression is symmetric, so we can use Cardano-Vieta to solve this.
Thank you for reading.
I usually use this trick. Let's call:
$$S_j=x_1^j+x_2^j+x_3^j$$
We are searching $S_8$. Trivially:
$$\left\{\begin{matrix} x_1^3+px_1+q=0\\ x_2^3+px_2+q=0\\ x_3^3+px_3+q=0 \end{matrix}\right.$$
If we multiply both sides for the monomial $x^j$ the sum of the powers of the roots doesn't change cause we are adding $n$ roots that are equal 0. So: $$\left\{\begin{matrix} x_1^{j+3}+px_1^{j+1}+qx_1^{j}=0\\ x_2^{j+3}+px_2^{j+1}+qx_1^{j}=0\\ x_3^{j+3}+px_3^{j+1}+qx_1^{j}=0 \end{matrix}\right.$$
Sum all of the terms and you get:
$$S_{j+3}=-pS_{j+1}-qS_{j}$$
So now we must calculate $S_2$ and $S_3$ and apply the recursion some times. $S_2$ is a standard calculus:
$$S_2=x_1^2+x_2^2+x_3^2=(x_1+x_2+x_3)^2-2(x_1x_2+x_1x_3+x_2x_3)$$
Applying Vieta formulas:
$$x_1+x_2+x_3=0$$ $$x_1x_2+x_1x_3+x_2x_3=p$$
So: $$S_2=-2p$$ Moreover for the recursion: $$S_{3}=-pS_{1}-qS_{0}=-3q$$
And for the recursive formula: $$S_5=-pS_3-qS_2=3pq+2pq=5pq$$ $$S_8=-pS_6-qS_5$$
A last effort for $S_7$: $$S_4=-pS_2-qS_1=2p^2$$ $$S_6=-pS_4-qS_3=-2p^3+3q^2$$
And finally:
$$S_8=-p(-2p^3+3q^2)-q(5pq)$$ $$S_8=2p^4-8pq^2 $$
:)