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 comments
Loading...
Problem Recent Solvers54
Suggested Problems
-
Find the sum of all the numbers of the input vector
55932 Solvers
-
Return the 3n+1 sequence for n
8541 Solvers
-
Number of 1s in the Binary Representation of a Number
491 Solvers
-
Write a function man that takes a row vector v and returns a matrix H as follows..
652 Solvers
-
Converts numbers into characters
2195 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!