Problem 1946. Fibonacci-Sum of Squares
Given the Fibonacci sequence defined by the following recursive relation,
- F(n) = F(n-1) + F(n-2)
- where F(1) = 1 and F(1) = 1
determine the sum of squares for the first "n" terms.
For example, n=5 --> 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.
- INPUT n=5
- OUTPUT S=40
Solution Stats
Problem Comments
-
3 Comments
goc3
on 23 May 2017
Additional test cases have been added.
Yingcong Zhou
on 24 Dec 2017
There is a typo in the question. F_0 = 0 should be F_0 = 1 otherwise the tests will not be passed.
Maryam HCTRAK Yousef
on 14 Aug 2020
It shows me wrong!
Solution Comments
Show commentsProblem Recent Solvers1304
Suggested Problems
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
1791 Solvers
-
544 Solvers
-
Determine Whether an array is empty
774 Solvers
-
551 Solvers
-
9493 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!