Problem 42340. Fibonacci Decomposition

Created by Ned Gulley

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Every positive integer has a unique decomposition into nonconsecutive Fibonacci numbers f1+f2+ ... Given a positive integer n, return these numbers.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Return the vector f = [f1, f2, ...] sorted from smallest to largest. sum(f) = n.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Examples</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ n = 3\n f = 3\n\n n = 32\n f = [3 8 21]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Reference:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.johndcook.com/blog/2015/05/17/fibonacci-number-system/\"><w:r><w:t>http://www.johndcook.com/blog/2015/05/17/fibonacci-number-system/</w:t></w:r></w:hyperlink></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

1070 Solutions
367 Solvers

Last Solution submitted on Jul 31, 2022

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Dang Quang Ha on 16 May 2022

quá ghê gớm, và đây là Folontilo

Solution Comments

Solution 677036

1 Comment

1 Comment

goc3 on 27 May 2021

Amazing.

Problem Recent Solvers367

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 42340. Fibonacci Decomposition

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers367

Suggested Problems

More from this Author50

Problem Tags

Community Treasure Hunt

Problem 42340. Fibonacci Decomposition

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers367

Suggested Problems

More from this Author50

Problem Tags

Community Treasure Hunt

Players