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. . . .
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.
How many noughts are at the end of these giant numbers?
I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?
The tangles created by the twists and turns of the Conway rope trick are surprisingly symmetrical. Here's why!
How many tours visit each vertex of a cube once and only once? How many return to the starting point?
Have a go at being mathematically negative, by negating these statements.
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. . . .
Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?
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.
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.
Find the positive integer solutions of the equation (1+1/a)(1+1/b)(1+1/c) = 2
Keep constructing triangles in the incircle of the previous triangle. What happens?
When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?
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.
Let a(n) be the number of ways of expressing the integer n as an ordered sum of 1's and 2's. Let b(n) be the number of ways of expressing n as an ordered sum of integers greater than 1. (i) Calculate. . . .
Can you convince me of each of the following: If a square number is multiplied by a square number the product is ALWAYS a square number...
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.
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.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
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. . . .
Here the diagram says it all. Can you find the diagram?
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.
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?
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. . . .
Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and fill in the blanks in truth tables to record. . . .
To find the integral of a polynomial, evaluate it at some special points and add multiples of these values.
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.
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.
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.
Find the largest integer which divides every member of the following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.
Tom writes about expressing numbers as the sums of three squares.
Follow the hints and prove Pick's Theorem.
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?
Toni Beardon has chosen this article introducing a rich area for practical exploration and discovery in 3D geometry
Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.
Prove that if the integer n is divisible by 4 then it can be written as the difference of two squares.
Investigate circuits and record your findings in this simple introduction to truth tables and logic.
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?
These proofs are wrong. Can you see why?
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.
Sort these mathematical propositions into a series of 8 correct 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. . . .
An introduction to some beautiful results of Number Theory
Can you invert the logic to prove these statements?
Given a set of points (x,y) with distinct x values, find a polynomial that goes through all of them, then prove some results about the existence and uniqueness of these polynomials.
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
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?