Problem 42340. Fibonacci Decomposition

• Created by Ned Gulley
• Appears in 3 groups

×

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

Introduction to MATLAB

• 23 Problems
• 8297 Finishers

M3 Challenge Problem Group

• 20 Problems
• 20 Finishers

Programování - Cody

• 12 Problems
• 461 Finishers

Like (14)

Difficulty:

(6717)

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.14% Correct | 54.86% Incorrect

• 1903 Solutions
• 751 Solvers

Last Solution submitted on Feb 26, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers751

Suggested Problems

• Back to basics 8 - Matrix Diagonals

  933 Solvers

• Back to basics 22 - Rotate a matrix

  910 Solvers

• Fill a zeros matrix

  624 Solvers

• Sophie Germain prime

  902 Solvers

• Unique values without using UNIQUE function

  371 Solvers

More from this Author50

• 2048 Next Move

  89 Solvers

• Placing Beads Neatly in a Box

  13 Solvers

• Find the biggest empty box

  487 Solvers

• Frobenius McNugget Factorization

  38 Solvers

• Twins in a Window

  157 Solvers