Problem 52594. Easy Sequences 10: Sum of Cumsums of Fibonacci Sequence
The function F(n) is defined as the set of Fibonacci numbers from the first up to the n-th. S(n) is the result of applying to F, the MATLAB built-in function 'cumsum' and followed by the function 'sum'. For example for n = 10, we have:
>> Fn = [1 1 2 3 5 8 13 21 34 55];
>> Sn = sum(cumsum(Fn))
>> Sn =
364
It has been argued that the Fibonacci sequence exhibits an exponentially growth relative to the golden ratio, which means that S(n) becomes very big, very quickly. So instead, we will do the inverse operation.
Given a number 's', our task is to find the largest 'n', such that S(n) is less than or equal to 's'. In the example above we have, 'n = 10' for 's = 364' .
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers30
Suggested Problems
-
Find the peak 3n+1 sequence value
2484 Solvers
-
Project Euler: Problem 7, Nth prime
1405 Solvers
-
Fix the last element of a cell array
1287 Solvers
-
314 Solvers
-
1462 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!