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];
Replace NaNs with the number that appears to its left in the row.
1710 Solvers
Remove the polynomials that have positive real elements of their roots.
447 Solvers
214 Solvers
Return unique values without sorting
482 Solvers
Find my daddy long leg (No 's')
122 Solvers
Problem Tags