Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
Here the diagram says it all. Can you find the diagram?
This is the second of two articles and discusses problems relating to the curvature of space, shortest distances on surfaces, triangulations of surfaces and representation by graphs.
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.
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.
Follow the hints and prove Pick's Theorem.
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. . . .
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.
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. . . .
These proofs are wrong. Can you see why?
Can you invert the logic to prove these statements?
Have a go at being mathematically negative, by negating these statements.
Can you work through these direct proofs, using our interactive proof sorters?
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
This is the second article on right-angled triangles whose edge lengths are whole numbers.
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.
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.
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?
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.
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.
Show that x = 1 is a solution of the equation x^(3/2) - 8x^(-3/2) = 7 and find all other solutions.
To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.
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?
By considering powers of (1+x), show that the sum of the squares of the binomial coefficients from 0 to n is 2nCn
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.
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!
Tom writes about expressing numbers as the sums of three squares.
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?
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
Can you rearrange the cards to make a series of correct mathematical 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. . . .
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
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?
L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?
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?
Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?
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.
Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.
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.
Can you find the areas of the trapezia in this sequence?
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.
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. . . .
Some diagrammatic 'proofs' of algebraic identities and inequalities.
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.
An article which gives an account of some properties of magic squares.
Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.
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. . . .
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?