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.
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. . . .
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 has. . . .
The knight's move on a chess board is 2 steps in one direction and one step in the other direction. Prove that a knight cannot visit every square on the board once and only (a tour) on a 2 by n board. . . .
I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?
Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?
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.
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?
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 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.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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.
An article which gives an account of some properties of magic squares.
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. . . .
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.
This is the second article on right-angled triangles whose edge lengths are whole numbers.
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?
Show that x = 1 is a solution of the equation x^(3/2) - 8x^(-3/2) = 7 and find all other solutions.
What can you say about the lengths of the sides of a quadrilateral whose vertices are on a unit circle?
Is the mean of the squares of two numbers greater than, or less than, the square of their means?
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.
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!
When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?
Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.
Follow the hints and prove Pick's Theorem.
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
Tom writes about expressing numbers as the sums of three squares.
Can you invert the logic to prove these statements?
Can you work through these direct proofs, using our interactive proof sorters?
Sort these mathematical propositions into a series of 8 correct statements.
Can you rearrange the cards to make a series of correct mathematical statements?
Have a go at being mathematically negative, by negating these statements.
This problem is a sequence of linked mini-challenges leading up to the proof of a difficult final challenge, encouraging you to think mathematically. Starting with one of the mini-challenges, how. . . .
These proofs are wrong. Can you see why?
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?
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?
Pick a square within a multiplication square and add the numbers on each diagonal. What do you notice?
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.
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.
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. . . .
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.
Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
Here the diagram says it all. Can you find the diagram?
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?
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.
Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.
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.
Which of these roads will satisfy a Munchkin builder?