Algebra problem (problem from Swedish 12th grade ‘Student Exam’ from 1932) The following problem is taken from a Swedish 12th grade ‘Student Exam’ from 1932.

The sum of two numbers are $a$, the sum of the 3rd powers is $10a^3$. Calculate the sum of the 4th powers, expressed in $a$.

Is there a shorter/simpler solution than the one presented below? It feels there is some ‘trick’ to it. The solution presented below is more a ‘straight forward’ one.

Solution
We have
\begin{gather*}
\left\{
\begin{aligned}
x+y&=a\\
x^3+y^3&=10a^3
\end{aligned}
\right.
\quad\Leftrightarrow\quad
x^3+(a-x)^3=10a^3
\quad\Leftrightarrow\quad
x^2-ax-3a^2=0
\end{gather*}
which has the solutions
$$
x_{1,2}=\tfrac{1}{2}(1\pm\sqrt{13}\,)a
\qquad \Rightarrow \qquad
y_{1,2}=\tfrac{1}{2}(1\mp\sqrt{13}\,)a.
$$
Since
$$
(1+z)^4+(1-z)^4=2(1+6z^2+z^4)
$$
we have
\begin{align*}
x_1^4+y_1^4
&
=\bigl(\tfrac{1}{2}(1+\sqrt{13}\,)a\bigr)^{\!4}+\bigl(\tfrac{1}{2}(1-\sqrt{13}\,)a\bigr)^{\!4}
=\tfrac{a^4}{16}\cdot2\bigl(1+6z^2+z^4\bigr)\big|_{z=\sqrt{13}}
\\&=\tfrac{a^4}{8}(1+6\cdot13+13^2)
=\tfrac{a^4}{8}\cdot248
=31a^4
\end{align*}
and, as above,
$$
x_2^4+y_2^4
=\bigl(\tfrac{1}{2}(1-\sqrt{13}\,)a\bigr)^{\!4}+\bigl(\tfrac{1}{2}(1+\sqrt{13}\,)a\bigr)^{\!4}
=31a^4.
$$
Hence, the answer is $31a^4$.

The original exam


Yes, there is a shorter solution that relies on the identity $$(x+y)(x^n + y^n) = (x^{n+1} + y^{n+1}) + xy(x^{n-1} + y^{n-1}),$$ which is easily verified by multiplication.  Then if we let $f_n = x^n + y^n$, this may be written $$f_{n+1} = (x+y)f_n - xy f_{n-1} = f_1 f_n - xy f_{n-1}.$$
Next, observe that $f_0 = 2$ for any nonzero choice of $x, y$.  In addition, we are given $f_1 = a$.  Then $$f_2 = f_1^2 - xy f_0 = a^2 - 2xy,$$ and $$f_3 = f_1 f_2 - xy f_1 = a(a^2 - 2xy - xy) = a(a^2 - 3xy).$$  Since we are also given $f_3 = 10a^3$, it follows that $10a^3 = a(a^2 - 3xy)$ and if $a \ne 0$, we obtain $$xy = -3a^2.$$  This gives us the information we need to compute $$f_4 = f_1 f_3 - xy f_2 = a (10a^3) - (-3a^2) (a^2 - 2(-3a^2)) = 31a^4$$ and we are done.  If $a = 0$, then $f_n$ is trivially $0$ for all $n \ge 1$.
Note this method furnishes the more general recursion $$f_{n+1} = a f_n + 3a^2 f_{n-1}, \quad f_0 = 2, \quad f_1 = a,$$ for which the non-recursive solution is $$f_n = \left(\frac{a}{2}\right)^n \left( (1 - \sqrt{13})^n + (1 + \sqrt{13})^n \right).$$
