Can you discover whether this is a fair game?
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.
Investigate circuits and record your findings in this simple introduction to truth tables and logic.
Prove Pythagoras' Theorem using enlargements and scale factors.
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
Mark a point P inside a closed curve. Is it always possible to find two points that lie on the curve, such that P is the mid point of the line joining these two points?
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.
Fractional calculus is a generalisation of ordinary calculus where you can differentiate n times when n is not a whole number.
Show that x = 1 is a solution of the equation x^(3/2) - 8x^(-3/2) = 7 and find all other solutions.
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. . . .
This article looks at knight's moves on a chess board and introduces you to the idea of vectors and vector addition.
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. . . .
Can you see how this picture illustrates the formula for the sum of the first six cube numbers?
Here the diagram says it all. Can you find the diagram?
Some diagrammatic 'proofs' of algebraic identities and inequalities.
Can you work through these direct proofs, using our interactive proof sorters?
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. . . .
Problem solving is at the heart of the NRICH site. All the problems give learners opportunities to learn, develop or use mathematical concepts and skills. Read here for more information.
Learn about the link between logical arguments and electronic circuits. Investigate the logical connectives by making and testing your own circuits and record your findings in truth tables.
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...
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.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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.
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?
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?
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.
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.
Tom writes about expressing numbers as the sums of three squares.
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.
An article which gives an account of some properties of magic squares.
Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.
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.
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.
Can you rearrange the cards to make a series of correct mathematical statements?
It is impossible to trisect an angle using only ruler and compasses but it can be done using a carpenter's square.
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?
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.
Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.
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.
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. . . .
L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?
Explore what happens when you draw graphs of quadratic equations with coefficients based on a geometric sequence.
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
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.
When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?
This is the second article on right-angled triangles whose edge lengths are whole numbers.
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!
Follow the hints and prove Pick's Theorem.
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.