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
-
2 Comments
Dang Quang Ha
on 16 May 2022
quá ghê gớm, và đây là Folontilo
Le
on 6 Dec 2024
=)))
Solution Comments
Show commentsProblem Recent Solvers919
Suggested Problems
-
Rotate and display numbered tile
377 Solvers
-
Compute a dot product of two vectors x and y
1046 Solvers
-
How many trades represent all the profit?
614 Solvers
-
1208 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2133 Solvers
More from this Author54
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!