Suppose you have a collection of rods of different integer lengths: 1 (cubes), 2, 3, 4, 5, etc. Have an indefinitely large number of strips of each length. But a bad guy steals all of your length 1. In how many possible ways can you build a row of length n with the remaining rods? By example,

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Fibonacci Numbers

8. Without the one
Suppose you have a collection of rods of different integer lengths: 1 (cubes), 2, 3, 4, 5,
etc. Have an indefinitely large number of strips of each length. But a bad guy steals all
of your length 1. In how many possible ways can you build a row of length n with the
remaining rods? By example,
length 2: 2 (1 shape)
length 3: 3 (1 shape)
length 4: 4=2+2 (2 ways)
length 5: 5=3+2=2+3 (3 ways).
The ways in which a natural number n can be decomposed into the sum of other natural
numbers are call the partitions of n. So, what we are asking is how many partitions can
we make of a number n, if we don't use 1, and the order of the addends matters. Yes,
indeed, the answer is again on the Fibonacci numbers. Why?
0:36 DM
Transcribed Image Text:8. Without the one Suppose you have a collection of rods of different integer lengths: 1 (cubes), 2, 3, 4, 5, etc. Have an indefinitely large number of strips of each length. But a bad guy steals all of your length 1. In how many possible ways can you build a row of length n with the remaining rods? By example, length 2: 2 (1 shape) length 3: 3 (1 shape) length 4: 4=2+2 (2 ways) length 5: 5=3+2=2+3 (3 ways). The ways in which a natural number n can be decomposed into the sum of other natural numbers are call the partitions of n. So, what we are asking is how many partitions can we make of a number n, if we don't use 1, and the order of the addends matters. Yes, indeed, the answer is again on the Fibonacci numbers. Why? 0:36 DM
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Hash Table
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education