Patrick Snow of Dame Alice Owens School, London, Marcos Charalambides from Cyprus and Andrei Lazanu from Romania sent solutions to this problem.

The famous golden ratio is g= 5+1 2 . Patrick and Andrei showed that
g2 = (5+1)2 4 = (6+25) 4 = (5+3) 2 =g+1

.

Marcos considered the equation x2 =x+1. By completing the square,
(x-1/2)2 =5/4

he obtained the solutions
x= 1±5 2 .

So g is one solution of this equation and hence g2 =g+1.

Both Andrei and Marcos then experimented a bit to get familiar with the problem...

Multiplying by g
g2 =g+1 g3 = g2 +g=2g+1 g4 =2 g2 +g=3g+2 g5 =3 g2 +2g=5g+3 g6 =5 g2 +3g=8g+5 .

Marcos then made the conjecture that an+1 = an + an-1 and these coefficients are the Fibonacci sequence. Similarly for the bn and went on to prove this conjecture using the method of mathematical induction.

Patrick used the result g2 =g+1 to find a pattern in the coefficients for gn = an g+ bn as follows. Multiplying by g gives
gn+1 = an g2 + bn g= an (g+1)+ bn g=( an + bn )g+ an .

Thus an+1 = an + bn and bn+1 = an . Hence an+1 = an + an-1 . This is the Fibonacci sequence. Since the first terms are a1 =1 and a2 =1 so gn = an g+ an-1 where ak is the k-th term of the Fibonacci sequence.

Then Patrick went on to prove by induction that an = αn - βn 5 where α and β are the solutions of the quadratic equation x2 =x+1. Now for n=1
α-β= 1+5 2 - 1-5 2 =5

and dividing this by 5 gives the value of a1 =1 showing that the result is true for n=1. For n=2
α2 - β2 5 = (α+1)-(β+1) 5 =1

as above giving the value of a2 =1 showing that the result is true for n=2. Assume the result for n=k and n=k-1 and using the fact that α2 =α+1 and β2 =β+1 then
ak+1 = ak + ak-1 = αk-1 (α+1)- βk-1 (β+1) 5 = αk+1 - βk+1 5

Hence by the axiom of induction the result is proved. Thus
gn = αn - βn 5 g+ αn-1 - βn-1 5 .