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
• 323 Finishers

Randomness

• 11 Problems
• 20 Finishers

Like (14)

Difficulty:

(32)

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.57% Correct | 54.43% Incorrect

• 1931 Solutions
• 772 Solvers

Last Solution submitted on May 06, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers772

Suggested Problems

• Indexed Probability Table

  2498 Solvers

• Distance walked 1D

  2506 Solvers

• Project Euler: Problem 1, Multiples of 3 and 5

  3416 Solvers

• Divisible by 5

  463 Solvers

• Pi Digit Probability

  684 Solvers

More from this Author50

• Prime Ladders

  49 Solvers

• Property dispute!

  39 Solvers

• Crossing to Kissing - Untangle the Lines

  31 Solvers

• Put two time series onto the same time basis

  332 Solvers

• Fix the last element of a cell array

  1603 Solvers