General instructions
This paper consists of SIX tasks. Attempt all tasks.
You may use a calculator.
Work with a partner. Write your answers in pencil. Submit ONE completed set of answers per pair.
Task 1: Matchstick triangles
Consider the following pattern created with matches:
![]() |
Activity 1.1:
Use the diagram above to help you complete the table below. You may draw additional sketches if you would like to.
| t (number of triangles) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| m(number of matches) | 3 | 6 |
Information section
Flow diagrams
One way to represent the relationship between the number of triangles and the number of matches is with a flow diagram, like the one given below.
![]() |
The flow diagram shows us that if we multiply the number of triangles by three we find the number of matches in the construction.
Equations
This flow diagram may be represented as an equation (or formula):
Instead of
We can use this equation to determine the number of matches required to build a row of 50 triangles. We know that
Working in reverse
Working in reverse we have the flow diagram below which shows how to work out the number of triangles that can be formed given the number of matches.
![]() |
The flow diagram shows us that if we divide the number of matches by three we get the number of triangles we could create in the construction.
This flow diagram may be represented as an equation:
We can use the equation to determine the maximum number of triangles we could build with 210 matches.
We know that
Activity 1.2:
Use the equations given in the information section to assist you in completing the following table:
| t(number of triangles) | 45 | |
| m(number of matches) | 600 |
Task 2: Matchstick squares
Consider the following pattern created with matches.
![]() |
Activity 2.1
Use the diagram to help you complete the following table. You may draw additional diagrams to help you.
| s(number of squares) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| m(number of matches) | 4 | 8 |
Activity 2.2
Complete the following flow diagrams, representing the relationship between the number of squares and the number of matches.
![]() |
![]() |
Activity 2.3
- 1) Write down the equation/ formula for calculating the number of matches required if we want to create s squares. Write it in the form m = …
- 2) Write down the equation/ formula for calculating the maximum number of squares we could create if we have m matches. Write it in the form s = …
Activity 2.4
Use your equations/ formulae from the previous activity to assist you in completing the following table:
| s(number of square) | 36 | |
| m(number of matches) | 480 |
Task 3: Linking matches
Consider the following pattern created with matches.
Matches have been joined together with blobs of prestik.
![]() |
Activity 3.1
Use the diagram above to help you fill in the table below. You may draw additional sketches if you wish.
| m(number of matches) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| b(number of blobs) | 0 | 1 |
Activity 3.2
Complete the following flow diagrams, representing the relationship between the number of matches and the number of blobs.
![]() |
Activity 3.3
Write down the equation/ formula for calculating the number of blobs required if you want to link m matches. Write it in the form b = …
Write down the equation/ formula for calculating the maximum number of matches you can join if you have b blobs. Write it in the form m = …
Activity 3.4
Use your equations/ formulae form the previous activity to help you fill in the following table.
| m(number of matches) | 55 | |
| b(number of blocks) | 127 |
Task four: More matchstick triangles
Consider the following pattern created with matches:
![]() |
Activity 4.1
Use the diagram above to help you fill in the table below. You may draw additional sketches if you wish.
| t(number of triangles) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| m(number of matches) | 3 | 5 |
Information section
More complex flow diagrams
One way to represent the relationship between the number of triangles and the number of matches is with a flow diagram, like the one given below. Two steps are required to determine the number of matches required to create a certain number of triangles.
![]() |
The flow diagram shows us that if we multiply the number of triangles by two and add one to our answer we find the number of matches in the construction.
Equations
This flow diagram may be represented as an equation:
Instead of
We can use the equation to determine the number of matches required to build a row of 50 triangles. We know that
Working in reverse
Working in reverse we have the flow diagram below, which shows how to work out the number of triangles that can be formed with a certain number of matches.
![]() |
The flow diagram shows us that if we subtract 1 from the number of matches and then divide the answer by two to get the number of triangles we could create in the construction.
The flow diagram may be represented as an equation:
We can use the equation to determine the maximum number of triangles we could build with 211 matches. We substitute 211 in place of m and then calculate t:
So we could create 105 triangles.
Activity 4.2
Use the equations given in the information section to assist you in completing the following table:
| t(number of triangles) | 70 | |
| m(number of matches) | 253 |
Task five: More matchstick squares
Consider the following pattern created with matches:
![]() |
Activiy 5.1
Use the diagram to help you complete the following table. You may draw additional diagrams to help you.
| s(number of squares) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| m(number of matches) | 4 | 7 |
Activity 5.2
Complete the following flow diagrams, representing the relationship between the number of squares and the number of matches.
![]() |
Activity 5.3
- 1) Write down the equation/ formula for calculating the number of matches required if we want to create s squares. Write it in the form m = …
- 2) Write down the equation/ formula for calculating the maximum number of squares we could create if we have m matches. Write it in the form s = …
Activity 5.4
Use your equations/ formulae from the previous activity to assist you in completing the following table:
| s(number of square) | 234 | |
| m(number of matches) | 463 |
Task 6: Matchstick houses
Consider the following pattern created with matches.
![]() |
Activity 6.1
Use the diagram above to help you fill in the table below. You may draw additional sketches if you wish.
| m(number of matches) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| b(number of blobs) | 6 | 11 |
Activity 6.2
Complete the following flow diagrams, representing the relationship between the number of matches and the number of blobs.
![]() |
Activity 6.3
Write down the equation/ formula for calculating the number of matches required if you want to create h houses. Write it in the form m = …
Write down the equation/ formula for calculating the maximum number of houses you can create if you have m matches. Write it in the form h = …
Activity 6.4
Use your equations/ formulae form the previous activity to help you fill in the following table.
| h(number of houses) | 120 | |
| m(number of matches) | 456 |
Extension Activities
Extension activity one
Investigate the following relationships in the pattern shown below.
![]() |
- 1) Investigate the relationship between the number of matches along one side of the big square and the number of small squares (with sides one matchstick in length) formed inside the biggest square.
| m(length of side of big square) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| s (number of small squares inside) | 1 | 4 |
- 1) Investigate the relationship between the number of matches along one side of the big square and the number of matches required altogether.
| m(length of side of big square) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| t(total number of matches) | 4 | 12 |
Extension activity two
Investigate the following relationships in the pattern below.
![]() |
1) Investigate the relationship between the number of matches along one side of the big triangle and the number of small triangles (with sides one matchstick in length) formed inside the biggest triangle.
| m(length of side of big triangle) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| s (number of small triangles inside) | 1 | 4 |
2) Investigate the relationship between the number of matches along one side of the big triangle and the number of matches required altogether.
| m(length of side of big triangle) | 1 | 2 | 3 | 4 | 6 | n | 20 |
| t(total number of matches) | 3 | 9 |





















