Number Patterns & Seqs
Number Patterns & Seqs
Activities
12.1 Lines
12.2 Regular Polygons
12.3 Towers
12.4 Ulam's Sequence
12.5 Bode's Law
12.6 Fibonacci Sequence
Notes and Solutions (1 page)
1. Draw similar diagrams to find the maximum number of crossover points and regions
for:
(a) 2 lines (b) 4 lines (c) 5 lines.
3. (a) Generalise your results and write down formulae for the maximum number of
crossovers and regions.
(b) Use the formulae to predict the maximum number of crossover points and
regions for:
(i) 20 lines (ii) 100 lines.
Extension
1. What are the conditions which must be fulfilled to ensure that you get the maximum
number of crossovers?
u1 = 3 u2 = 4 u3 = 5 u4 = 6
Here is a sequence of regular polygons. Let un be the number of sides of the nth shape in
the sequence. You can see that:
u1 = 3 , u 2 = 4 , . . .
3. How many diagonals can be drawn from a single vertex in each of the shapes above?
4. How many diagonals can be drawn from a vertex of the nth shape in the sequence?
5. How many diagonals in total can be drawn in each of the shapes above?
Extension
For the second shape, when all the diagonals have been drawn,
1 there are 4 regions enclosed.
4 2
1. Repeat this process for the third and fourth shapes
3
2. Generalise your results to the nth shape.
How many cubes are needed to build a tower which has 100 steps?
At first sight, this might seem daunting but here are two ways of tackling this kind of
problem. Both methods demonstrate how powerful mathematical analysis can be.
1 Iteration
Here we find the formula which fits the data.
3. Assuming the formula for un , the number of cubes in the nth tower is
un = an 2 + bn + c .
Using n = 1 , 2 and 3, write down three equations satisfied by a, b and c.
Solve these equations for a, b and c and use your formula to check u 6 .
2. Deduce that:
n (n − 1)
un = n × 1 + × 22 .
⇓ ⇓ ⇓ 2
A sequence can be made for many reasons and it can be very interesting to try to invent the
rules for one and investigate what happens. Here is a sequence for which the rules were
invented by Stanislaw Ulam, an American mathematician.
For example:
3 is in Ulam's Sequence because 3 = 1 + 2, and both these numbers are already in the
sequence. Also, 3 cannot be made in any other way by adding two different numbers.
Extension
Investigate what would happen if:
(a) you used another pair of numbers as a starting point,
(e.g. change the order, use a zero as one of the pair, use a negative number).
(b) the sequence required three numbers to be added.
In 1772, the German astronomer, Johann Bode, published his law which relates the distance
ratio:
distance of the planet from the Sun
xn =
distance of the Earth from the Sun
to n, the number which Bode used to specify each planet, as shown in the table below.
n =1 Venus
n =2 Earth
n =3 Mars
n =4
n =5 Jupiter
n =6 Saturn
n =7 Uranus
n =8 Neptune
n =9 Pluto
Not to scale
4. A large number of asteroids are found at about 433.8 × 10 6 km from the Sun.
Does Bode's Law provide confirmation that there was once a single planet at this
position? [Hint: consider x 4 .]
5. Do the data support the view that Neptune and Pluto were once a single planet?
The Italian mathematician, Leonardo de Pisa (nicknamed Fibonacci) lived from about
AD1170 to 1250. He devoted much of his time and effort to the study of the so-called
Fibonacci numbers:
13
Multiply the two outside numbers and then the two inside numbers and note the
difference.
Try this with other sets of four consecutive Fibonacci numbers. What do you notice?
4. Square each of the first five consecutive Fibonacci numbers and add the results.
Then multiply the fifth and sixth terms. What do you notice?
Now square and add the first six numbers and multiply the 6th and 7th numbers.
Generalise your results.
Extension
Investigate sequences obeying the Fibonacci relationship but with different starting values,
e.g. replace (1, 1) by (1, 3).