Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Ding Dong Bell:

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

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

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

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

Shuffle Shriek

Stage: 3 Challenge Level: Challenge Level:1

Can you find all the 4-ball shuffles?

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

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

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

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

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

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

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

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

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

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

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

One O Five

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

You can work out the number someone else is thinking of as follows. Ask a friend to think of any natural number less than 100. Then ask them to tell you the remainders when this number is divided by. . . .

problem icon

Multiplication Square

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

Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?

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

The Triangle Game

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

Can you discover whether this is a fair game?

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

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

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

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

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

Eleven

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

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

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

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

Pyramids

Stage: 3 Challenge Level: Challenge Level:1

What are the missing numbers in the pyramids?

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

A Chordingly

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

Find the area of the annulus in terms of the length of the chord which is tangent to the inner circle.

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

Always the Same

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

Arrange the numbers 1 to 16 into a 4 by 4 array. Choose a number. Cross out the numbers on the same row and column. Repeat this process. Add up you four numbers. Why do they always add up to 34?

problem icon

Marbles

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

I start with a red, a green and a blue marble. I can trade any of my marbles for two others, one of each colour. Can I end up with five more blue marbles than red after a number of such trades?

problem icon

More Mathematical Mysteries

Stage: 3 Challenge Level: Challenge Level:1

Write down a three-digit number Change the order of the digits to get a different number Find the difference between the two three digit numbers Follow the rest of the instructions then try. . . .

problem icon

The Genie in the Jar

Stage: 3 Challenge Level: Challenge Level:1

This jar used to hold perfumed oil. It contained enough oil to fill granid silver bottles. Each bottle held enough to fill ozvik golden goblets and each goblet held enough to fill vaswik crystal. . . .

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

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

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

More Marbles

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

I start with a red, a blue, a green and a yellow marble. I can trade any of my marbles for three others, one of each colour. Can I end up with exactly two marbles of each colour?

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

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

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

Growing Ls

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

Can you fit Ls together to make larger versions of themselves?

problem icon

Seven Squares - Group-worthy Task

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

Choose a couple of the sequences. Try to picture how to make the next, and the next, and the next... Can you describe your reasoning?

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

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

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

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. . . .