The sequence $S_n$ is defined as $$S_1=S_2 =1$$ and for $n\ge 2$, $$S_{n+1}=2(A_n + G_n)$$ where $A_n = \frac {S_n+S_{n-1}}{2}$ is the arithmetic mean and $G_n= \sqrt { S_nS_{n-1} }$ is the geometric mean.
Claim: $$S_n = (F_n)^2$$ where $F_n$ stands for Fibonacci's numbers.
My solution:
$$S_{n+1}=2(A_n +G_n)= 2(\frac {S_n+S_{n-1}}{2}+\sqrt { S_nS_{n-1} })$$
$$=S_n+S_{n-1}+2\sqrt { S_nS_{n-1} }$$
$$= ( \sqrt { S_n} + \sqrt S_{n-1} )^2$$
$$\sqrt { S_{n+1}}=\sqrt { S_n} + \sqrt S_{n-1} \implies $$
$$\sqrt { S_n} =F_n \implies S_n = (F_n)^2$$
$$S_{n+1}=S_n+2\sqrt{S_nS_{n-1}}+S_{n-1}=(\sqrt{S_n}+\sqrt{S_{n-1}})^2$$ So if we let $F_n=\sqrt{S_n}$, then $F_1=F_2=1$ and $$F_{n+1}=F_n+F_{n-1}$$ Can you take it from here?