Simply 'having a go' is a great way to make a start on a mathematical problem. Whatever happens, you will have learnt more about the situation and can then tweak your approach. These activities all lend themselves to this 'trial and improvement' way of working.
This collection is one of our Primary Curriculum collections - tasks that are grouped by topic.
problem
Favourite
Fifteen cards
Age
7 to 11
Challenge level
Can you use the information to find out which cards I have used?
problem
Favourite
Zios and Zepts
Age
7 to 11
Challenge level
On the planet Vuv there are two sorts of creatures. The Zios have 3 legs and the Zepts have 7 legs. The great planetary explorer Nico counted 52 legs. How many Zios and how many Zepts were there?
problem
Favourite
Four-digit targets
Age
7 to 11
Challenge level
You have two sets of the digits 0-9. Can you arrange these in the five boxes to make four-digit numbers as close to the target numbers as possible?
problem
Favourite
Area and perimeter
Age
7 to 11
Challenge level
What can you say about these shapes? This problem challenges you to create shapes with different areas and perimeters.
game
Daisy
In this game for two players, take it in turns to shade one petal, or two petals next to each other. Is it better to go first or second?
problem
Four Colours
Age
5 to 11
Challenge level
Kate has eight multilink cubes. She has two red ones, two yellow, two green and two blue. She wants to fit them together to make a cube so that each colour shows on each face just once.
problem
Favourite
Fractions in a Box
Age
7 to 11
Challenge level
The discs for this game are kept in a flat square box with a square hole for each. Use the information to find out how many discs of each colour there are in the box.
problem
Favourite
Cycling Squares
Age
7 to 11
Challenge level
Can you make a cycle of pairs that add to make a square number using all the numbers in the box below, once and once only?
problem
Favourite
Factor-Multiple Chains
Age
7 to 11
Challenge level
Can you see how these factor-multiple chains work? Find the chain which contains the smallest possible numbers. How about the largest possible numbers?