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
-
Determine whether a vector is monotonically increasing
20127 Solvers
-
Find the peak 3n+1 sequence value
2483 Solvers
-
Return elements unique to either input
761 Solvers
-
Check if number exists in vector
11041 Solvers
-
769 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!