# Search by Topic

#### Resources tagged with Mathematical reasoning & proof similar to Number Chains:

Filter by: Content type:
Stage:
Challenge level:

### There are 181 results

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

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

### Tower of Hanoi

##### Stage: 4 Challenge Level:

The Tower of Hanoi is an ancient mathematical challenge. Working on the building blocks may help you to explain the patterns you notice.

### Dalmatians

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

Investigate the sequences obtained by starting with any positive 2 digit number (10a+b) and repeatedly using the rule 10a+b maps to 10b-a to get the next number in the sequence.

### Big, Bigger, Biggest

##### Stage: 5 Challenge Level:

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

### Long Short

##### Stage: 4 Challenge Level:

A quadrilateral inscribed in a unit circle has sides of lengths s1, s2, s3 and s4 where s1 ≤ s2 ≤ s3 ≤ s4. Find a quadrilateral of this type for which s1= sqrt2 and show s1 cannot. . . .

### Pareq Exists

##### Stage: 4 Challenge Level:

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

### Pair Squares

##### Stage: 5 Challenge Level:

The sum of any two of the numbers 2, 34 and 47 is a perfect square. Choose three square numbers and find sets of three integers with this property. Generalise to four integers.

### Mechanical Integration

##### Stage: 5 Challenge Level:

To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.

### Polite Numbers

##### Stage: 5 Challenge Level:

A polite number can be written as the sum of two or more consecutive positive integers. Find the consecutive sums giving the polite numbers 544 and 424. What characterizes impolite numbers?

### Unit Interval

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

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

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

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

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

### Janine's Conjecture

##### Stage: 4 Challenge Level:

Janine noticed, while studying some cube numbers, that if you take three consecutive whole numbers and multiply them together and then add the middle number of the three, you get the middle number. . . .

### Proof Sorter - Quadratic Equation

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

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.

### Thousand Words

##### Stage: 5 Challenge Level:

Here the diagram says it all. Can you find the diagram?

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

##### Stage: 5 Challenge Level:

Find all positive integers a and b for which the two equations: x^2-ax+b = 0 and x^2-bx+a = 0 both have positive integer solutions.

### Water Pistols

##### Stage: 5 Challenge Level:

With n people anywhere in a field each shoots a water pistol at the nearest person. In general who gets wet? What difference does it make if n is odd or even?

### Binomial

##### Stage: 5 Challenge Level:

By considering powers of (1+x), show that the sum of the squares of the binomial coefficients from 0 to n is 2nCn

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

### Where Do We Get Our Feet Wet?

##### Stage: 5

Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.

### Sums of Squares and Sums of Cubes

##### Stage: 5

An account of methods for finding whether or not a number can be written as the sum of two or more squares or as the sum orf two or more cubes.

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

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

### Try to Win

##### Stage: 5

Solve this famous unsolved problem and win a prize. Take a positive integer N. If even, divide by 2; if odd, multiply by 3 and add 1. Iterate. Prove that the sequence always goes to 4,2,1,4,2,1...

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

### Recent Developments on S.P. Numbers

##### Stage: 5

Take a number, add its digits then multiply the digits together, then multiply these two results. If you get the same number it is an SP number.

### Magic Squares II

##### Stage: 4 and 5

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

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

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

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

### Pythagorean Triples I

##### Stage: 3 and 4

The first of two articles on Pythagorean Triples which asks how many right angled triangles can you find with the lengths of each side exactly a whole number measurement. Try it!

### More Sums of Squares

##### Stage: 5

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

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

### Proof of Pick's Theorem

##### Stage: 5 Challenge Level:

Follow the hints and prove Pick's Theorem.

### Pythagorean Triples II

##### Stage: 3 and 4

This is the second article on right-angled triangles whose edge lengths are whole numbers.

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

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

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

### L-triominoes

##### Stage: 4 Challenge Level:

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

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

### Proof Sorter - Sum of an AP

##### Stage: 5 Challenge Level:

Use this interactivity to sort out the steps of the proof of the formula for the sum of an arithmetic series. The 'thermometer' will tell you how you are doing

### Tree Graphs

##### Stage: 4 Challenge Level:

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

### Find the Fake

##### Stage: 4 Challenge Level:

There are 12 identical looking coins, one of which is a fake. The counterfeit coin is of a different weight to the rest. What is the minimum number of weighings needed to locate the fake coin?

### An Introduction to Number Theory

##### Stage: 5

An introduction to some beautiful results of Number Theory

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

### Zig Zag

##### Stage: 4 Challenge Level:

Four identical right angled triangles are drawn on the sides of a square. Two face out, two face in. Why do the four vertices marked with dots lie on one line?