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/

Solve

Solution Stats

2283 Solutions

955 Solvers

Last Solution submitted on Oct 18, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers955

Sadat Al Rashad Evan Conroy Yazeed Asiri Erjan

Suggested Problems

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!