N.B. For the purpose of this exercise, the first Fibonacci number is 1, and the second is 2; that is, fib(1) = 1 and fib(2) = 2 .
Make a function isfib(x) so that:
- if the value of the input x is not a Fibonacci number, the function returns a zero.
- if the value of the input x is a Fibonacci number, the function returns its index in the Fibonacci sequence. That is, isfib(fib(n)) should return the value of n .
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers51
Suggested Problems
-
Remove any row in which a NaN appears
8767 Solvers
-
980 Solvers
-
698 Solvers
-
1707 Solvers
-
Find out sum and carry of Binary adder
1692 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
5.731478440138172e+20 from 7th test is not a Fibonacci Number. 100th Fibonacci Number in proposed convention is 573147844013817084101 which has 21 digits and exceeds double precision.
I agree with Jan. http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibtable.html (this list begins at 0). The 100th fibonnaci number is 573147844013817084101 (5.731478440138171e+20), and not 5.731478440138172e+20.