In 1202, Leonardo Fibonacci (1170-1250) posed the following famous problem:
Suppose a particular breed of rabbit breeds a new pair of rabits each month,
except that a 1-month old pair is too young to breed. Suppose further that
no rabbit breeds with any other except its paired mate, and that rabbits
live forever.
Then at 1 month, we have our original pair of rabbits.
At 2 months, we have the original pair (and their offspring, which are too
young to breed).
At three months, we will have two breeding pairs.
At four months, we will have three pairs.
At five months, there are five pairs.
At the
th month, we will have
pairs of rabbits, given by the
inductive sequence
for all natural numbers
. The
are the well-known Fibonacci numbers, which arise in many other contexts besides breeding
rabbits.
Use complete induction to show that for any natural number
,
for all natural numbers
.