One Rule, Many Number Patterns


A pattern built from addition
A short list of numbers can grow surprisingly fast when each new number depends on the two before it. Start with 0 and 1. Add them to get 1. Then add the two most recent numbers, 1 and 1, to get 2. Continue in the same way, and the list begins:
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 ...
This is the Fibonacci sequence. A sequence is an ordered list, and each number in it is called a term. The rule for this sequence is simple: after the first two terms, each term is the sum of the previous two. For example, 13 + 21 = 34, and 21 + 34 = 55.
The sequence is named for Fibonacci, an Italian mathematician also known as Leonardo of Pisa. In his 1202 book Liber Abaci, he described a problem about an idealized population of rabbits. The problem produced the same pattern of addition, although real rabbit populations do not grow according to that simple model.
Changing the starting terms
The addition rule does not require the sequence to start with 0 and 1. Two different starting terms produce a different list, even though the process stays the same. Beginning with 2 and 1 gives:
- idealized:
- Simplified to represent an idea rather than every detail of real life.
- model:
- A simplified representation used to describe or study something.
- dictate:
- To determine or control what must happen.
- alignment:
- An arrangement in which related items line up.
- corresponding:
- Matching in position or purpose.
- consecutive:
- Following one after another without a break.
- undefined:
- Not having a mathematical value under the given conditions.
- arrangements:
- Ways in which things are organized or placed.
Where this passage belongs
You Might Also Like
About this report passage for Middle School
“One Rule, Many Number Patterns” is a report reading passage about Fibonacci and number patterns, written for Middle School. It takes about 6 minutes to read (899 words) and comes with an interactive quiz and a printable worksheet with comprehension questions and an answer key.


