# Search by Topic

#### Resources tagged with Mathematical reasoning & proof similar to Five Circuits, Seven Spins:

Filter by: Content type:
Stage:
Challenge level:

### There are 185 results

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

### Problem Solving, Using and Applying and Functional Mathematics

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

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.

### The Triangle Game

##### Stage: 3 and 4 Challenge Level:

Can you discover whether this is a fair game?

##### Stage: 4 Challenge Level:

Four jewellers possessing respectively eight rubies, ten saphires, a hundred pearls and five diamonds, presented, each from his own stock, one apiece to the rest in token of regard; and they. . . .

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

### AMGM

##### Stage: 4 Challenge Level:

Choose any two numbers. Call them a and b. Work out the arithmetic mean and the geometric mean. Which is bigger? Repeat for other pairs of numbers. What do you notice?

### Areas and Ratios

##### Stage: 4 Challenge Level:

What is the area of the quadrilateral APOQ? Working on the building blocks will give you some insights that may help you to work it out.

### Proofs with Pictures

##### Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

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

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

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

### Three Frogs

##### Stage: 4 Challenge Level:

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

### Stonehenge

##### Stage: 5 Challenge Level:

Explain why, when moving heavy objects on rollers, the object moves twice as fast as the rollers. Try a similar experiment yourself.

### Picture Story

##### Stage: 4 Challenge Level:

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

### Rolling Coins

##### Stage: 4 Challenge Level:

A blue coin rolls round two yellow coins which touch. The coins are the same size. How many revolutions does the blue coin make when it rolls all the way round the yellow coins? Investigate for a. . . .

### Natural Sum

##### Stage: 4 Challenge Level:

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

### Rotating Triangle

##### Stage: 3 and 4 Challenge Level:

What happens to the perimeter of triangle ABC as the two smaller circles change size and roll around inside the bigger circle?

### Middle Man

##### Stage: 5 Challenge Level:

Mark a point P inside a closed curve. Is it always possible to find two points that lie on the curve, such that P is the mid point of the line joining these two points?

### Air Nets

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

Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.

### The Great Weights Puzzle

##### Stage: 4 Challenge Level:

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?

### Sperner's Lemma

##### Stage: 5

An article about the strategy for playing The Triangle Game which appears on the NRICH site. It contains a simple lemma about labelling a grid of equilateral triangles within a triangular frame.

### Exhaustion

##### Stage: 5 Challenge Level:

Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2

### Napoleon's Hat

##### Stage: 5 Challenge Level:

Three equilateral triangles ABC, AYX and XZB are drawn with the point X a moveable point on AB. The points P, Q and R are the centres of the three triangles. What can you say about triangle PQR?

### To Prove or Not to Prove

##### Stage: 4 and 5

A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.

### Iffy Logic

##### Stage: 4 Short Challenge Level:

Can you rearrange the cards to make a series of correct mathematical statements?

### Big, Bigger, Biggest

##### Stage: 5 Challenge Level:

Which is the biggest and which the smallest of $2000^{2002}, 2001^{2001} \text{and } 2002^{2000}$?

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

### Dodgy Proofs

##### Stage: 5 Challenge Level:

These proofs are wrong. Can you see why?

### Advent Calendar 2011 - Secondary

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

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

### Interpolating Polynomials

##### Stage: 5 Challenge Level:

Given a set of points (x,y) with distinct x values, find a polynomial that goes through all of them, then prove some results about the existence and uniqueness of these polynomials.

### Proximity

##### Stage: 4 Challenge Level:

We are given a regular icosahedron having three red vertices. Show that it has a vertex that has at least two red neighbours.

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

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

### Diverging

##### Stage: 5 Challenge Level:

Show that for natural numbers x and y if x/y > 1 then x/y>(x+1)/(y+1}>1. Hence prove that the product for i=1 to n of [(2i)/(2i-1)] tends to infinity as n tends to infinity.

### A Long Time at the Till

##### Stage: 4 and 5 Challenge Level:

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?

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

### Square Pair Circles

##### Stage: 5 Challenge Level:

Investigate the number of points with integer coordinates on circles with centres at the origin for which the square of the radius is a power of 5.

### Similarly So

##### Stage: 4 Challenge Level:

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.

### Number Rules - OK

##### Stage: 4 Challenge Level:

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

### Mediant

##### Stage: 4 Challenge Level:

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.

### A Computer Program to Find Magic Squares

##### Stage: 5

This follows up the 'magic Squares for Special Occasions' article which tells you you to create a 4by4 magicsquare with a special date on the top line using no negative numbers and no repeats.

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

### Composite Notions

##### Stage: 4 Challenge Level:

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

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

### More Sums of Squares

##### Stage: 5

Tom writes about expressing numbers as the sums of three squares.

### Transitivity

##### Stage: 5

Suppose A always beats B and B always beats C, then would you expect A to beat C? Not always! What seems obvious is not always true. Results always need to be proved in mathematics.

### A Knight's Journey

##### Stage: 4 and 5

This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.

### Rhombus in Rectangle

##### Stage: 4 Challenge Level:

Take any rectangle ABCD such that AB > BC. The point P is on AB and Q is on CD. Show that there is exactly one position of P and Q such that APCQ is a rhombus.

### Modulus Arithmetic and a Solution to Differences

##### Stage: 5

Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.

### 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?

### Euler's Formula and Topology

##### Stage: 5

Here is a proof of Euler's formula in the plane and on a sphere together with projects to explore cases of the formula for a polygon with holes, for the torus and other solids with holes and the. . . .

### Euclid's Algorithm II

##### Stage: 5

We continue the discussion given in Euclid's Algorithm I, and here we shall discover when an equation of the form ax+by=c has no solutions, and when it has infinitely many solutions.

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