Problem 42340. Fibonacci Decomposition
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
-
1 Comment
Dang Quang Ha
on 16 May 2022
quá ghê gớm, và đây là Folontilo
Solution Comments
Show commentsProblem Recent Solvers568
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
48153 Solvers
-
953 Solvers
-
Longest run of consecutive numbers
5316 Solvers
-
Removing rows from a matrix is easy - but what about inserting rows?
205 Solvers
-
Make a vector of prime numbers
633 Solvers
More from this Author50
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!