Search by Topic

Resources tagged with Mathematical reasoning & proof similar to The Four Colour Theorem:

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There are 178 results

Broad Topics > Using, Applying and Reasoning about Mathematics > Mathematical reasoning & proof

problem icon

Konigsberg Plus

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Euler discussed whether or not it was possible to stroll around Koenigsberg crossing each of its seven bridges exactly once. Experiment with different numbers of islands and bridges.

problem icon

Pattern of Islands

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...

problem icon

Königsberg

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Can you cross each of the seven bridges that join the north and south of the river to the two islands, once and once only, without retracing your steps?

problem icon

Symmetric Tangles

Stage: 4

The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!

problem icon

Tourism

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.

problem icon

The Great Weights Puzzle

Stage: 4 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

You have twelve weights, one of which is different from the rest. Using just 3 weighings, can you identify which weight is the odd one out, and whether it is heavier or lighter than the rest?

problem icon

Concrete Wheel

Stage: 3 Challenge Level: Challenge Level:1

A huge wheel is rolling past your window. What do you see?

problem icon

Master Minding

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Your partner chooses two beads and places them side by side behind a screen. What is the minimum number of guesses you would need to be sure of guessing the two beads and their positions?

problem icon

Magic Squares II

Stage: 4 and 5

An article which gives an account of some properties of magic squares.

problem icon

How Many Dice?

Stage: 3 Challenge Level: Challenge Level:1

A standard die has the numbers 1, 2 and 3 are opposite 6, 5 and 4 respectively so that opposite faces add to 7? If you make standard dice by writing 1, 2, 3, 4, 5, 6 on blank cubes you will find. . . .

problem icon

Geometry and Gravity 2

Stage: 3, 4 and 5

This is the second of two articles and discusses problems relating to the curvature of space, shortest distances on surfaces, triangulations of surfaces and representation by graphs.

problem icon

Sticky Numbers

Stage: 3 Challenge Level: Challenge Level:1

Can you arrange the numbers 1 to 17 in a row so that each adjacent pair adds up to a square number?

problem icon

Aba

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

In the following sum the letters A, B, C, D, E and F stand for six distinct digits. Find all the ways of replacing the letters with digits so that the arithmetic is correct.

problem icon

Proof: A Brief Historical Survey

Stage: 4 and 5

If you think that mathematical proof is really clearcut and universal then you should read this article.

problem icon

9 Weights

Stage: 3 Challenge Level: Challenge Level:1

You have been given nine weights, one of which is slightly heavier than the rest. Can you work out which weight is heavier in just two weighings of the balance?

problem icon

Sprouts Explained

Stage: 2, 3, 4 and 5

This article invites you to get familiar with a strategic game called "sprouts". The game is simple enough for younger children to understand, and has also provided experienced mathematicians with. . . .

problem icon

Shuffle Shriek

Stage: 3 Challenge Level: Challenge Level:1

Can you find all the 4-ball shuffles?

problem icon

Online

Stage: 3 Challenge Level: Challenge Level:1

A game for 2 players that can be played online. Players take it in turns to select a word from the 9 words given. The aim is to select all the occurrences of the same letter.

problem icon

Triangle Inequality

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

ABC is an equilateral triangle and P is a point in the interior of the triangle. We know that AP = 3cm and BP = 4cm. Prove that CP must be less than 10 cm.

problem icon

Convex Polygons

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Show that among the interior angles of a convex polygon there cannot be more than three acute angles.

problem icon

Volume of a Pyramid and a Cone

Stage: 3

These formulae are often quoted, but rarely proved. In this article, we derive the formulae for the volumes of a square-based pyramid and a cone, using relatively simple mathematical concepts.

problem icon

Problem Solving, Using and Applying and Functional Mathematics

Stage: 1, 2, 3, 4 and 5 Challenge Level: Challenge Level:1

Problem solving is at the heart of the NRICH site. All the problems give learners opportunities to learn, develop or use mathematical concepts and skills. Read here for more information.

problem icon

Tree Graphs

Stage: 4 Challenge Level: Challenge Level:1

A connected graph is a graph in which we can get from any vertex to any other by travelling along the edges. A tree is a connected graph with no closed circuits (or loops. Prove that every tree. . . .

problem icon

Flight of the Flibbins

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Blue Flibbins are so jealous of their red partners that they will not leave them on their own with any other bue Flibbin. What is the quickest way of getting the five pairs of Flibbins safely to. . . .

problem icon

Hockey

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

After some matches were played, most of the information in the table containing the results of the games was accidentally deleted. What was the score in each match played?

problem icon

Knight Defeated

Stage: 4 Challenge Level: Challenge Level:1

The knight's move on a chess board is 2 steps in one direction and one step in the other direction. Prove that a knight cannot visit every square on the board once and only (a tour) on a 2 by n board. . . .

problem icon

Go Forth and Generalise

Stage: 3

Spotting patterns can be an important first step - explaining why it is appropriate to generalise is the next step, and often the most interesting and important.

problem icon

Three Frogs

Stage: 4 Challenge Level: Challenge Level:1

Three frogs hopped onto the table. A red frog on the left a green in the middle and a blue frog on the right. Then frogs started jumping randomly over any adjacent frog. Is it possible for them to. . . .

problem icon

Con Tricks

Stage: 3

Here are some examples of 'cons', and see if you can figure out where the trick is.

problem icon

Some Circuits in Graph or Network Theory

Stage: 4 and 5

Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.

problem icon

Eleven

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Replace each letter with a digit to make this addition correct.

problem icon

Disappearing Square

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Do you know how to find the area of a triangle? You can count the squares. What happens if we turn the triangle on end? Press the button and see. Try counting the number of units in the triangle now. . . .

problem icon

Ordered Sums

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

Let a(n) be the number of ways of expressing the integer n as an ordered sum of 1's and 2's. Let b(n) be the number of ways of expressing n as an ordered sum of integers greater than 1. (i) Calculate. . . .

problem icon

Picture Story

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

Can you see how this picture illustrates the formula for the sum of the first six cube numbers?

problem icon

Whole Number Dynamics II

Stage: 4 and 5

This article extends the discussions in "Whole number dynamics I". Continuing the proof that, for all starting points, the Happy Number sequence goes into a loop or homes in on a fixed point.

problem icon

Whole Number Dynamics I

Stage: 4 and 5

The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.

problem icon

Postage

Stage: 4 Challenge Level: Challenge Level:1

The country Sixtania prints postage stamps with only three values 6 lucres, 10 lucres and 15 lucres (where the currency is in lucres).Which values cannot be made up with combinations of these postage. . . .

problem icon

Ratty

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

If you know the sizes of the angles marked with coloured dots in this diagram which angles can you find by calculation?

problem icon

Whole Number Dynamics III

Stage: 4 and 5

In this third of five articles we prove that whatever whole number we start with for the Happy Number sequence we will always end up with some set of numbers being repeated over and over again.

problem icon

The Triangle Game

Stage: 3 and 4 Challenge Level: Challenge Level:1

Can you discover whether this is a fair game?

problem icon

Yih or Luk Tsut K'i or Three Men's Morris

Stage: 3, 4 and 5 Challenge Level: Challenge Level:1

Some puzzles requiring no knowledge of knot theory, just a careful inspection of the patterns. A glimpse of the classification of knots and a little about prime knots, crossing numbers and. . . .

problem icon

Whole Number Dynamics IV

Stage: 4 and 5

Start with any whole number N, write N as a multiple of 10 plus a remainder R and produce a new whole number N'. Repeat. What happens?

problem icon

Classifying Solids Using Angle Deficiency

Stage: 3 and 4 Challenge Level: Challenge Level:1

Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry

problem icon

Logic, Truth Tables and Switching Circuits Challenge

Stage: 3, 4 and 5

Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and fill in the blanks in truth tables to record. . . .

problem icon

Children at Large

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

There are four children in a family, two girls, Kate and Sally, and two boys, Tom and Ben. How old are the children?

problem icon

Circle Box

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

It is obvious that we can fit four circles of diameter 1 unit in a square of side 2 without overlapping. What is the smallest square into which we can fit 3 circles of diameter 1 unit?

problem icon

Natural Sum

Stage: 4 Challenge Level: Challenge Level:1

The picture illustrates the sum 1 + 2 + 3 + 4 = (4 x 5)/2. Prove the general formula for the sum of the first n natural numbers and the formula for the sum of the cubes of the first n natural. . . .

problem icon

Tessellating Hexagons

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Is it true that any convex hexagon will tessellate if it has a pair of opposite sides that are equal, and three adjacent angles that add up to 360 degrees?

problem icon

Clocked

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Is it possible to rearrange the numbers 1,2......12 around a clock face in such a way that every two numbers in adjacent positions differ by any of 3, 4 or 5 hours?

problem icon

Cosines Rule

Stage: 4 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Three points A, B and C lie in this order on a line, and P is any point in the plane. Use the Cosine Rule to prove the following statement.