1
answer
0
watching
78
views
cyangnat500Lv1
6 Nov 2019
f(1)^2 + f(2)^2 + f(3)^2 + .... + f(n)^2 = f(n)f(n+1) for alln>1
where f(x) is the ith fibonnacci number. The fibonnacci numbersare defined by f(1)=f(2) =1 and the recursion relation f(n+1) =f(n) + f(n-1)
f(1)^2 + f(2)^2 + f(3)^2 + .... + f(n)^2 = f(n)f(n+1) for alln>1
where f(x) is the ith fibonnacci number. The fibonnacci numbersare defined by f(1)=f(2) =1 and the recursion relation f(n+1) =f(n) + f(n-1)
Keith LeannonLv2
5 Aug 2019
