# Questions on Fibonacci and Golden Ratio Identities

In a recent post I used the Fibonacci tiling to demonstrate that

$$F_nF_{n+1}=\sum_{k=0}^nF_k^2$$

Having some additional Fibonacci tilings in my toolbox (see two figures below), I set out to see what else I could find. Thus, I arrived at

$$F_{n~(\text{odd})}^2=\sum_{k=0}^{n-1}F_kF_{k+1}+1\\ F_{n~(\text{even})}^2=\sum_{k=0}^{n-1}F_kF_{k+1}$$

These equations can be found online and in the literature (see References). My question is how to derive them from the basic Fibonacci identities. Various attempts rapidly got me nowhere. Specifically, I tried starting with the recursion relation and Cassini's identity.

In a similar vein, using golden ratio tilings, I found the remarkably symmteric relations

$$\varphi^n\varphi^{n+1}=\sum_{k=-\infty}^{n}(\varphi^k)^2\\ (\varphi^n)^2=\sum_{k=-\infty}^{n-1}\varphi^k\varphi^{k+1}$$

Here again, I'm at a loss as to how to derive these results. An interesting result accrues if we substitute the first of the above in the second, to wit

$$(\varphi^n)^2=\sum_{k=-\infty}^{n-1}(n-k)(\varphi^k)^2$$

References

S Vajda, Fibonacci and Lucas numbers, and the Golden Section: Theory and Applications, Dover Press (2008).

Figures  in induction on n: $\sum _0 ^0 (f_n ^ 2)$ = $f_0 ^ 2$ = 1 = $f_0$$f_1 - checked f_n+1$$f_n+2$ = $f_n ^2$+$f_n$$f_n+1 = \sum _0^ n$$^+$$^1$$ f_n^2$
• My error in thinking was in trying to do the induction starting at $n$ and working backwards. Rue the day. BTW what is WNTP? Oct 2 '17 at 19:05
The Fibonacci number identities can be derived by induction using the fact that $$F_{n+1}^2 - F_{n-1}^2 = (F_{n+1} - F_{n-1}) (F_{n+1} + F_{n-1}) = F_n(F_{n+1} + F_{n-1}) = F_{n-1} F_n + F_n F_{n+1}.$$ Similarly you can prove the identities for the golden ratio by induction.