Problem 42340. Fibonacci Decomposition

• Created by Ned Gulley
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

All Things Fibonacci

• 9 Problems
• 319 Finishers

Randomness

• 11 Problems
• 19 Finishers

Like (14)

Difficulty:

(477)

Rate

• Solve Later   
• Add To GroupÂ

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

45.33% Correct | 54.67% Incorrect

• 1917 Solutions
• 761 Solvers

Last Solution submitted on Apr 22, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers761

Suggested Problems

• Return elements unique to either input

  777 Solvers

• Multiples of a Number in a Given Range

  775 Solvers

• Given a matrix, swap the 2nd & 3rd columns

  1150 Solvers

• Make a vector of prime numbers

  802 Solvers

• Convert a Cell Array into an Array

  1949 Solvers

More from this Author50

• Rotate and display numbered tile

  358 Solvers

• Would Homer Like It?

  18 Solvers

• Placing Beads Neatly in a Box

  13 Solvers

• Do the line-segments intersect?

  70 Solvers

• MatCAT - Reconstruct X from Its X-rays

  122 Solvers