Search by Topic

Resources tagged with Mathematical reasoning & proof similar to An Introduction to Mathematical Induction:

Filter by: Content type:
Stage:
Challenge level:

There are 184 results

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

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.

Prime AP

Stage: 4 Challenge Level:

Show that if three prime numbers, all greater than 3, form an arithmetic progression then the common difference is divisible by 6. What if one of the terms is 3?

More Sums of Squares

Stage: 5

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

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.

Picture Story

Stage: 4 Challenge Level:

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

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?

Mod 3

Stage: 4 Challenge Level:

Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.

N000ughty Thoughts

Stage: 4 Challenge Level:

Factorial one hundred (written 100!) has 24 noughts when written in full and that 1000! has 249 noughts? Convince yourself that the above is true. Perhaps your methodology will help you find the. . . .

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

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

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.

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.

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.

Sixational

Stage: 4 and 5 Challenge Level:

The nth term of a sequence is given by the formula n^3 + 11n . Find the first four terms of the sequence given by this formula and the first term of the sequence which is bigger than one million. . . .

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.

Stage: 5 Challenge Level:

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

Particularly General

Stage: 5 Challenge Level:

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

What Numbers Can We Make Now?

Stage: 3 and 4 Challenge Level:

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

Big, Bigger, Biggest

Stage: 5 Challenge Level:

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

How Many Solutions?

Stage: 5 Challenge Level:

Find all the solutions to the this equation.

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.

Geometric Parabola

Stage: 4 Challenge Level:

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

Why 24?

Stage: 4 Challenge Level:

Take any prime number greater than 3 , square it and subtract one. Working on the building blocks will help you to explain what is special about your results.

Take Three from Five

Stage: 3 and 4 Challenge Level:

Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?

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.

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.

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

Continued Fractions II

Stage: 5

In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).

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.

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.

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.

Pythagorean Triples II

Stage: 3 and 4

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

Proof of Pick's Theorem

Stage: 5 Challenge Level:

Follow the hints and prove Pick's Theorem.

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!

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.

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.

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.

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.

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

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.

The Triangle Game

Stage: 3 and 4 Challenge Level:

Can you discover whether this is a fair game?

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

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.

Exponential Intersection

Stage: 5 Challenge Level:

Can the pdfs and cdfs of an exponential distribution intersect?