Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Weekly Problem 14 - 2009:

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

There are 177 results

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

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

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

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

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

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

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

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

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

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

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

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

Dicing with Numbers

Stage: 3 Challenge Level: Challenge Level:1

In how many ways can you arrange three dice side by side on a surface so that the sum of the numbers on each of the four faces (top, bottom, front and back) is equal?

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

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

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

Chocolate Maths

Stage: 3 Challenge Level: Challenge Level:1

Pick the number of times a week that you eat chocolate. This number must be more than one but less than ten. Multiply this number by 2. Add 5 (for Sunday). Multiply by 50... Can you explain why it. . . .

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

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

Concrete Wheel

Stage: 3 Challenge Level: Challenge Level:1

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

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

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

The Triangle Game

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

Can you discover whether this is a fair game?

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

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

Proof Sorter - Quadratic Equation

Stage: 4 and 5 Challenge Level: Challenge Level:2 Challenge Level:2

This is an interactivity in which you have to sort the steps in the completion of the square into the correct order to prove the formula for the solutions of quadratic equations.

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

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

Matter of Scale

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

Prove Pythagoras Theorem using enlargements and scale factors.

problem icon

More Number Pyramids

Stage: 3 and 4 Challenge Level: Challenge Level:2 Challenge Level:2

When number pyramids have a sequence on the bottom layer, some interesting patterns emerge...

problem icon

Calendar Capers

Stage: 3 Challenge Level: Challenge Level:1

Choose any three by three square of dates on a calendar page. Circle any number on the top row, put a line through the other numbers that are in the same row and column as your circled number. Repeat. . . .

problem icon

Road Maker

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

Which of these roads will satisfy a Munchkin builder?

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

Shuffle Shriek

Stage: 3 Challenge Level: Challenge Level:1

Can you find all the 4-ball shuffles?

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

Truth Tables and Electronic Circuits

Stage: 2, 3 and 4

Investigate circuits and record your findings in this simple introduction to truth tables and logic.

problem icon

Mindreader

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

A little bit of algebra explains this 'magic'. Ask a friend to pick 3 consecutive numbers and to tell you a multiple of 3. Then ask them to add the four numbers and multiply by 67, and to tell you. . . .

problem icon

Mediant

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

If you take two tests and get a marks out of a maximum b in the first and c marks out of d in the second, does the mediant (a+c)/(b+d)lie between the results for the two tests separately.

problem icon

On the Importance of Pedantry

Stage: 3, 4 and 5

A introduction to how patterns can be deceiving, and what is and is not a proof.

problem icon

What Numbers Can We Make Now?

Stage: 3 and 4 Challenge Level: Challenge Level:2 Challenge Level:2

Imagine we have four bags containing numbers from a sequence. What numbers can we make now?

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.

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

Number Rules - OK

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

Can you convince me of each of the following: If a square number is multiplied by a square number the product is ALWAYS a square number...

problem icon

Mouhefanggai

Stage: 4

Imagine two identical cylindrical pipes meeting at right angles and think about the shape of the space which belongs to both pipes. Early Chinese mathematicians call this shape the mouhefanggai.

problem icon

Similarly So

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

ABCD is a square. P is the midpoint of AB and is joined to C. A line from D perpendicular to PC meets the line at the point Q. Prove AQ = AD.

problem icon

Composite Notions

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

A composite number is one that is neither prime nor 1. Show that 10201 is composite in any base.

problem icon

L-triominoes

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

L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?

problem icon

What Numbers Can We Make?

Stage: 3 Challenge Level: Challenge Level:1

Imagine we have four bags containing a large number of 1s, 4s, 7s and 10s. What numbers can we make?

problem icon

A Long Time at the Till

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

Try to solve this very difficult problem and then study our two suggested solutions. How would you use your knowledge to try to solve variants on the original problem?