Every positive integer has a unique decomposition into nonconsecutive Fibonacci numbers f1+f2+ ... Given a positive integer n, return these numbers.
Return the vector f = [f1, f2, ...] sorted from smallest to largest. sum(f) = n.
Examples
n = 3 f = 3
n = 32 f = [3 8 21]
Reference: http://www.johndcook.com/blog/2015/05/17/fibonacci-number-system/
Solution Stats
Problem Comments
Recent Solvers22
Suggested Problems
-
Calculate the Levenshtein distance between two strings
278 Solvers
-
197 Solvers
-
69 Solvers
-
What is Sum Of all elements of Matrix
184 Solvers
-
Number of Even Elements in Fibonacci Sequence
303 Solvers
More from this Author63
Tags
Discover what MATLAB® can do for your career.
Opportunities for recent engineering grads.
Apply Today