# Search by Topic

#### Resources tagged with Mathematical reasoning & proof similar to OK! Now Prove It:

Filter by: Content type:
Stage:
Challenge level:

### There are 186 results

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

### Proof Sorter - Geometric Series

##### Stage: 5 Challenge Level:

This is an interactivity in which you have to sort into the correct order the steps in the proof of the formula for the sum of a geometric series.

### A Biggy

##### Stage: 4 Challenge Level:

Find the smallest positive integer N such that N/2 is a perfect cube, N/3 is a perfect fifth power and N/5 is a perfect seventh power.

### Big, Bigger, Biggest

##### Stage: 5 Challenge Level:

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

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

### 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 of two or more cubes.

### Picture Story

##### Stage: 4 Challenge Level:

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

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

### More Sums of Squares

##### Stage: 5

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

### Modulus Arithmetic and a Solution to Dirisibly Yours

##### Stage: 5

Peter Zimmerman from Mill Hill County High School in Barnet, London gives a neat proof that: 5^(2n+1) + 11^(2n+1) + 17^(2n+1) is divisible by 33 for every non negative integer n.

### Direct Logic

##### Stage: 5 Challenge Level:

Can you work through these direct proofs, using our interactive proof sorters?

### Geometric Parabola

##### Stage: 4 Challenge Level:

Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.

### Particularly General

##### Stage: 5 Challenge Level:

By proving these particular identities, prove the existence of general cases.

### Plus or Minus

##### Stage: 5 Challenge Level:

Make and prove a conjecture about the value of the product of the Fibonacci numbers $F_{n+1}F_{n-1}$.

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

### The Triangle Game

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

Can you discover whether this is a fair game?

### Generally Geometric

##### Stage: 5 Challenge Level:

Generalise the sum of a GP by using derivatives to make the coefficients into powers of the natural numbers.

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

##### Stage: 5 Challenge Level:

Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.

### How Many Solutions?

##### Stage: 5 Challenge Level:

Find all the solutions to the this equation.

### Euler's Squares

##### Stage: 4 Challenge Level:

Euler found four whole numbers such that the sum of any two of the numbers is a perfect square. Three of the numbers that he found are a = 18530, b=65570, c=45986. Find the fourth number, x. You. . . .

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

### Without Calculus

##### Stage: 5 Challenge Level:

Given that u>0 and v>0 find the smallest possible value of 1/u + 1/v given that u + v = 5 by different methods.

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

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

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

### Magic Squares II

##### Stage: 4 and 5

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

##### Stage: 5 Short Challenge Level:

Can you work out where the blue-and-red brick roads end?

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

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

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

### Proofs with Pictures

##### Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

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

### Rational Roots

##### Stage: 5 Challenge Level:

Given that a, b and c are natural numbers show that if sqrt a+sqrt b is rational then it is a natural number. Extend this to 3 variables.

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

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

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

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

### Angle Trisection

##### Stage: 4 Challenge Level:

It is impossible to trisect an angle using only ruler and compasses but it can be done using a carpenter's square.

### Modular Fractions

##### Stage: 5 Challenge Level:

We only need 7 numbers for modulus (or clock) arithmetic mod 7 including working with fractions. Explore how to divide numbers and write fractions in modulus arithemtic.

### Magic W Wrap Up

##### Stage: 5 Challenge Level:

Prove that you cannot form a Magic W with a total of 12 or less or with a with a total of 18 or more.

### Postage

##### Stage: 4 Challenge Level:

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

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

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

### Telescoping Functions

##### Stage: 5

Take a complicated fraction with the product of five quartics top and bottom and reduce this to a whole number. This is a numerical example involving some clever algebra.

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

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