Imagine a machine with four coloured lights which respond to different rules. Can you find the smallest possible number which will make all four colours light up?
These spinners will give you the tens and unit digits of a number. Can you choose sets of numbers to collect so that you spin six numbers belonging to your sets in as few spins as possible?
I am thinking of three sets of numbers less than 101. They are the
red set, the green set and the blue set. Can you find all the
numbers in the sets from these clues?
Nearly all of us have made table patterns on hundred squares, that is 10 by 10 grids. This problem looks at the patterns on differently sized square grids.