On dotted paper we explored circles of different radius, counting the dots on or inside the circle. Brilliantly the number of dots is very close to the area of the circle.
We wrote this program in Python to check the ratio of dots to area for different size circles.
Challenge 1 Imagine you have an endless supply of 5p and 7p coins. You could make exactly 20p with four 5p coins. Or you could make exactly 19p with two 7p coins and a 5p coin.
What is the biggest amount that you cannot make? Can you explain why you can make all amounts after this one?
Challenge 2 The biggest number you cannot make given coins of value x and y is called the Frobenius number.
Can you think of a pair of numbers that wouldn’t have a Frobenius number?
What must be true about the two numbers for them to have a Frobenius number?
Challenge 3 Can you come up with a formula for the Frobenius number, if it exists, for two numbers x and y?
Mr D. R. Kaprekar was an Indian school maths teacher who loved playing with numbers. See if you can follow these steps to find out what he discovered …
Choose a four digit number where the
digits are not all the same (that is not 1111, 2222,…).
Rearrange the digits to get the
largest and smallest numbers these digits can make.
Finally, subtract the smallest number
from the largest to get a new number, and carry on repeating the operation for
each new number.
What do you notice?
Does something similar happen for 3 digit numbers? Can you prove it?
In the 501 game of darts players take turns at throwing 3 darts to reduce their score to zero.
A “checkout” refers to the process of finishing a game by reducing a player’s score to exactly zero, by hitting a double or the bullseye (50 points) with the final dart.
For example, if a player has 40 remaining, they can hit the double 20 (D20) to win.
The maximum checkout is 170. How can you make this?
For which numbers between 140 to 170 can you find a three dart checkout?
140
150
160
141
151
161
142
152
162
143
153
163
144
154
164
145
155
165
146
156
166
147
157
167
148
158
168
149
159
169
Most darts players like to aim to finish on D20, D18, D16 or maybe Bullseye.
A player has 94 left with three darts. They aim for T18
What is their checkout if they hit T18?
What is their next dart if they hit a single 18 instead?
Imagine you have three darts. Would you rather a score of 32 or 30 left? Think about what happens if you just miss D16 and get single 16 left versus just missing D15 and getting single 15.
What checkouts can you find for three darts on 107? What would be the best option do you think?
Here is a pdf with explanations adapted from Better Explained and all the activities below. Solutions to all the activities can be found here.
Decimal
15
20
32
47
50
170
171
141
Hexadecimal
F
14
20
2F
32
AA
AB
8D
Activity 1
Colour in all the hexagons that are multiples of 7 when converted to decimal numbers.
Activity 2
Fill in the table below. You will need to work out what the 3rd column represents in hexadecimal numbers
Decimal
17
88
740
Hexadecimal
11B
FFF
1000
Activity 3
Find the sum of 3A5 + 2D1 by converting to decimal, doing the addition and converting back to hexadecimal.
Can you do it without converting to decimal numbers?
Activity 4
What’s great about binary?
It’s the simplest number system as it only uses two digits – 1 and 0. This means it is very easy to build in hardware. You just need things that can turn on or off (representing 1 and 0), so it is fundamental to all computers. For example, in a transistor, ‘0’ means no electricity is flowing, whilst ‘1’ means there is a flow of electricity.
How are binary and hexadecimals linked?
Because one block of four binary numbers represents one hexadecimal number it is easy for programmers to visualise numbers in hexadecimal. Programmers sometimes use words written in hexadecimal in their programs.
Take the sequence above. Cross off all the numbers in the middle that share a factor with either 24 or 35. You should be stuck with 29 and 31 not crossed out.
Can you choose a sequence where you can cross out all the numbers in the middle? It can start anywhere and be any length.
You might be familiar with divisibility rules such as “A number is divisible by 3 if the sum of the digits is divisible by 3”. You can see some more here.
Our investigation today was – can we develop a set of divisibility rules for binary numbers?
Divisible by 2
This was straightforward. If the rightmost (unit) digit is 0 then the number is divisible by 2.
e.g. The number 6 is divisible by 2
but the number 7 is not
Can you extend this logic to create a divisibility rule for powers of 2 (e.g. 4, 8, 16 …)? Solution
This activity came from watching this Numberphile video . A worksheet of the activities below is available here.
Suppose that we want to colour the whole plane so that any two points at distance 1 from each other would have different colors.
You can imagine this as walking on a tiled floor in jumps of 1 and each jump has to be onto a different colour.
What is the minimum number of colours we would need to use?
Finding an upper bound to the number of colours needed
Task 1
It doesn’t have to be a regular tiling, but would 4 colours work if we coloured the plane like above? How big would the squares have to be?
Task 2
Find a number of colours that would work for a square tiling. How big would the squares have to be?
Task 3
Show that we would need at most 7 colours using a different shape tile (isometric paper will be helpful!).
Finding an lower bound to the number of colours needed
Task 4
Use this diagram to show that we would need at least 3 colours to colour the plane.
Task 5
Create a graph of points to show that we need at least 4 colours.
Further reading
This problem is called the Hadwiger–Nelson problem and was stated in 1950. It was recently (2018!) proved that you need at least 5 colours by an amaetur mathematician who was working on it as a break from his job as a maverick biologist intent on extending the human lifespan! The middle dot in the picture below has to be white rather than red, green, blue or yellow like the rest. It is still an open problem to find the smallest number of colors. It could now be 5, 6 or 7 and nobody knows.
Today we used inspiration from Nrich and mathsisfun.com to explore the Platonic solids on Polypad.
Task 1 – Dodecahedron
Go to https://polypad.amplify.com/p#polygons and make a net of a dodecahedron. You can keep adding pentagons together and then highlight them all and click Fold Net.
If it is not quite right, click Unfold Net and then add/remove pentagons and try again.
Task 2 – Angle deficit
The angle deficit at a vertex of a polyhedron is a measure of how far short each angle sum is from 360°. For example, in a dodecahedron, three pentagons with interior angles of 108° meet at each vertex, so the angle sum is 324° and the angle deficit is 36°:
The total angle deficit is the sum of the deficits at each vertex.
Can you fill in the table for the Dodecahedron:
Platonic Solids
Regular polygons
Faces
Vertex form
Angle Sum
Angle Deficit
Number of Vertices
Total Angle Deficit
Cube
Squares
Tetrahedron
Triangle
Octahedron
Triangle
Icosahedron
Triangle
Dodecahedron
Pentagon
5,5,5
324
36
Task 3 – Make the nets and fill in the table for the other four Platonic Solids. These are 3D shapes where the faces are congruent regular polygons and the same number of faces meet at each vertex.
Task 4 – Find all the Archimedean Solids which are formed by two or more types of regular polygons, each with the same side length and such that each vertex has the same pattern of polygons around it.
20 is a practical number because it could be used to design a set of weights where all of its factors are the weights and you can weigh all the numbers from 1 to 20 using each weight only once.
The factors of 20 are: 1, 2, 4, 5, 10 and 20
And you can make the numbers 1 to 20 using combinations of these numbers (each number can be used a maximum of once):
So 20 is a practical number
Of course all powers of 2 are practical numbers, but can you find some others?
Do they have anything in common?
Are there an infinite number of practical numbers?
Once you’ve found some can you use them to generate more?
Using these facts:
The product of two practical numbers is also a practical number.
More strongly, the least common multiple of any two practical numbers is also a practical number.
if n is a practical number and d is one of its divisors then d must also be a practical number.
So for example with the primitive practical numbers 1 and 2 you can generate 2*2=4
So 4 is not a primitive number as it can be generated from previous ones.
Can you circle all the practical numbers in this grid, using a different colour for primitive practical numbers?
Solution can be found here. To read more about Practical Numbers check out Wikipedia and this talk.
Using Python
Task 1
Change the program so that the factors are given in a list (you can use e.g. factors.append(i) after setting up a blank list called factors
What do you think would have happened if you had started this process with a value of 0.2001 for x rather than 0.2? Those two numbers are very close, almost the same, so you would think they’d produce a fairly similar sequence of numbers…
Each line segment is coloured either red or blue. One player (usually the first, or left, player) is only allowed to cut blue line segments, while the other player (usually the second, or right, player) is only allowed to cut red line segments.
On their turn, a player “cuts” (erases) any line segment of their choice. Every line segment no longer connected to the ground by any path “falls” (i.e., gets erased). According to the normal play convention of combinatorial game theory, the first player who is unable to move loses.
When the dots on square dotty paper are joined by straight lines the enclosed figures have dots on their perimeter (a) and often internal (b) ones as well.
Figures can be described in this way: (a,b). For example, the red square has an (a,b) of (4,0), the grey triangle (3,1), the green triangle (5,0) and the blue hexagon (6,4):
Questions:
Can you draw all (4,0) shapes?
Can you draw all (5,0) shapes?
Can you draw all (4,1) shapes?
Can you draw all (4,2) shapes?
Can you draw various shapes with area 4cm2
What do you notice about the area of the shapes from your work on questions 1-4?
Can you come up with a formula for the Area in terms of a and b?
We played the great game of SET and then answered these questions. The answers can be found in this document from The Madison Math Circle. Thanks to them and David J Bruce for the ideas.
We also started to think about how to represent cards in a geometric space. If you take a simple game of set with just two characteristics, you can plot each card in 2D and hence work out how many cards you can have on the table before you make a set (by not drawing a straight line). See here for the details.
The Irish logarithm is an algorithm invented by Percy Ludgate in 1909 for multiplying single-digit numbers. The idea was to program a computer to do these calculations. The algorithm uses two tables to perform the multiplication. With just these tables you can calculate products up to 9×9 simply by adding two numbers together.
Here are blank versions of the two tables below (and as a pdf).
Our challenge was to fill in these tables. Here is the start of an attempt that would not work …
1 x 2 would be 1+2 so the correct answer of 2 needs to be in the box called 3.
1×3 would be 1+3 so the correct answer of 3 needs to be in the box called 4.
2×3 would be 2+3 so the correct answer of 6 needs to be in the box called 5.
So far so good ….
But … 2×2 would be 2+2 so the correct answer of 4 needs to go in the box called 4. But the box called 4 already has a 3 in it, so our initial choice of numbers is a bad one.
Can you do better?
It is very difficult to come up with the solution from scratch (but do try!). Here are a few numbers already filled in, if you would like a starting point (and as a pdf).