There are twelve identical looking islanders and a seesaw. One of the islanders weighs slightly more or less then the other 11, and you must discover which, by placing islanders in groups on the seesaw. However only three measurements are allowed.
We found this activity on Nrich and it was originally in one of Brian Bolt’s books and developed by MEDIAN in their collection of interesting number resources.
This Daisy is special because you can make every number from 1 to 25. You are only allowed to add neighbours (numbers touching each other) and you can only use each number once in a sum.
Can you do better than this with a different set of numbers? The challenge is to find six numbers to go in the Daisy from which you can make all the numbers from 1 to a number bigger than 25.
You can check your ideas here:
Could you adapt the program above to search for a higher solution?
To write the program above we needed to find all the combinations from a general daisy like this:
For example you can have a+b or a+f but not a+d. Can you find all the combinations? There is a worksheet to fill in here (with the solution on the second page). An editable version is here.
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?