Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Snowman:

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

There are 176 results

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

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

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

Not Necessarily in That Order

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

Baker, Cooper, Jones and Smith are four people whose occupations are teacher, welder, mechanic and programmer, but not necessarily in that order. What is each person’s occupation?

problem icon

Russian Cubes

Stage: 4 Challenge Level: Challenge Level:1

I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?

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

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

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

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

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

Tis Unique

Stage: 3 Challenge Level: Challenge Level:1

This addition sum uses all ten digits 0, 1, 2...9 exactly once. Find the sum and show that the one you give is the only possibility.

problem icon

Advent Calendar 2011 - Secondary

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

Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.

problem icon

Football Champs

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

Three teams have each played two matches. The table gives the total number points and goals scored for and against each team. Fill in the table and find the scores in the three matches.

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

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

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

Online

Stage: 2 and 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

Top-heavy Pyramids

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

Use the numbers in the box below to make the base of a top-heavy pyramid whose top number is 200.

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

Concrete Wheel

Stage: 3 Challenge Level: Challenge Level:1

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

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

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

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

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

Greetings

Stage: 3 Challenge Level: Challenge Level:1

From a group of any 4 students in a class of 30, each has exchanged Christmas cards with the other three. Show that some students have exchanged cards with all the other students in the class. How. . . .

problem icon

Doodles

Stage: 4 Challenge Level: Challenge Level:1

Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?

problem icon

Road Maker

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

Which of these roads will satisfy a Munchkin builder?

problem icon

Triangle Incircle Iteration

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

Keep constructing triangles in the incircle of the previous triangle. What happens?

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

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

Diophantine N-tuples

Stage: 4 Challenge Level: Challenge Level:1

Can you explain why a sequence of operations always gives you perfect squares?

problem icon

N000ughty Thoughts

Stage: 4 Challenge Level: Challenge Level:1

How many noughts are at the end of these giant numbers?

problem icon

Unit Interval

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

Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?

problem icon

Long Short

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

What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?

problem icon

Logic

Stage: 2 and 3

What does logic mean to us and is that different to mathematical logic? We will explore these questions in this article.

problem icon

Tessellating Hexagons

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

Which hexagons tessellate?

problem icon

Converse

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

Clearly if a, b and c are the lengths of the sides of an equilateral triangle then a^2 + b^2 + c^2 = ab + bc + ca. Is the converse true?

problem icon

Cycle It

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

Carry out cyclic permutations of nine digit numbers containing the digits from 1 to 9 (until you get back to the first number). Prove that whatever number you choose, they will add to the same total.

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

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

Logic, Truth Tables and Switching Circuits

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 record your findings in truth tables.

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

Pareq Exists

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

Prove that, given any three parallel lines, an equilateral triangle always exists with one vertex on each of the three lines.

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

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

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

Picturing Pythagorean Triples

Stage: 4 and 5

This article discusses how every Pythagorean triple (a, b, c) can be illustrated by a square and an L shape within another square. You are invited to find some triples for yourself.

problem icon

Paradoxes

Stage: 2 and 3

A paradox is a statement that seems to be both untrue and true at the same time. This article looks at a few examples and challenges you to investigate them for yourself.

problem icon

Whole Number Dynamics V

Stage: 4 and 5

The final of five articles which containe the proof of why the sequence introduced in article IV either reaches the fixed point 0 or the sequence enters a repeating cycle of four values.

problem icon

Magic Squares II

Stage: 4 and 5

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

problem icon

Impossible Sandwiches

Stage: 3, 4 and 5

In this 7-sandwich: 7 1 3 1 6 4 3 5 7 2 4 6 2 5 there are 7 numbers between the 7s, 6 between the 6s etc. The article shows which values of n can make n-sandwiches and which cannot.