I need to show that for the terms of the fibonnaci sequence, where $n \ge 1$, $a_{n-1}^2 + a_{n}^2 = a_{2n-1}$
So far, I have this:
$a_{n-1}^2 + a_{n}^2$
$=a_{n-1}^2 +(a_{n-1} + a_{n-2}$
$=a_{n-1}^2 +a_{n-1}^2 + a_{n-2}^2 + 2a_{n-1}a_{n-2}$
$=a_{n-1}^2 + a_{2n-3} + 2a_{n-1}a_{n-2}$
$=a_{n-1} (a_{n-1} + 2a_{n-2}) + a_{2n-3}$
$=a_{n-1} (a_{n} + a_{n-2}) + a_{2n-3}$
I'm kind of stuck at this point. How can I simplify the first part so it becomes $a_{2n-2}$? I was thinking that would be necessary so I could have $a_{2n-3} + a_{2n-2} = a_{2n-1}$
$a_{n-1}^2+a_{n}^2=a_{2n-1}$
base case: $n = 2$
$a_1^2 + a_2^2 = a_3\\ 1^2 + 1^2 = 2$
Suppose for all $n\le k, a_{n-1}^2+a_{n}^2=a_{2n-1}$
We must show that
$a_{k}^2+a_{k+1}^2=a_{2k+1}$
$a_{2k+1} =$$ a_{2k} + a_{2k-1}\\ = 2a_{2k-1} + a_{2k-2}\\ = 3a_{2k-1} - a_{2k-3}$
$a_{2k+1} = 3(a_k^2 + a_{k-1}^2) - (a_{k-1}^2 + a_{k-2}^2)$
by the inductive hypothesis
$3a_k^2 + 2 a_{k-1}^2 - a_{k-2}^2\\ 3a_k^2 + a_{k-1}^2 + (a_{k-1}+a_{k-2})(a_{k-1}-a_{k-2})\\ 3a_k^2 + a_{k-1}^2 + (a_{k})(a_{k-1}-a_{k-2})\\ a_k(3a_k + a_{k-1}-a_{k-2}) + a_{k-1}^2\\ a_k(2a_k + 2a_{k-1}) + a_{k-1}^2\\ 2a_k^2 + 2a_ka_{k-1} + a_{k-1}^2\\ a_k^2 + (a_{k}+a_{k-1})^2\\ a_k^2 + a_{k+1}^2$