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 Solvers600
Suggested Problems
-
10020 Solvers
-
Convert a numerical matrix into a cell array of strings
1830 Solvers
-
Return the first and last characters of a character array
9918 Solvers
-
706 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
1911 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!