In the sequence of Fibonacci numbers, every number is the sum of the two preceding ones:
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, ...
The initial two numbers are generally chosen as [1, 1].
Given one or more integers n, find the next integer that is a Fibonacci number, for each of them.
Example 1:
n = 6; out = 8;
Example 2:
n = [12 44 50]; out = [13 55 55];
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers918
Suggested Problems
-
Remove all the words that end with "ain"
2687 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2883 Solvers
-
Sum of first n terms of a harmonic progression
517 Solvers
-
555 Solvers
-
Convert given decimal number to binary number.
2341 Solvers
More from this Author2
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!