Investigate circuits and record your findings in this simple introduction to truth tables and logic.
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. . . .
Investigate the sequences obtained by starting with any positive 2
digit number (10a+b) and repeatedly using the rule 10a+b maps to
10b-a to get the next number in the sequence.
Take any whole number between 1 and 999, add the squares of the
digits to get a new number. Make some conjectures about what
happens in general.
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.
Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.
An article which gives an account of some properties of magic squares.
If you think that mathematical proof is really clearcut and
universal then you should read this article.
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.
Euler discussed whether or not it was possible to stroll around Koenigsberg crossing each of its seven bridges exactly once. Experiment with different numbers of islands and bridges.
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. . . .
An iterative method for finding the value of the Golden Ratio with explanations of how this involves the ratios of Fibonacci numbers and continued fractions.
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.
Start with any triangle T1 and its inscribed circle. Draw the
triangle T2 which has its vertices at the points of contact between
the triangle T1 and its incircle. Now keep repeating this. . . .
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.
Your partner chooses two beads and places them side by side behind a screen. What is the minimum number of guesses you would need to be sure of guessing the two beads and their positions?
In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...
Can you cross each of the seven bridges that join the north and south of the river to the two islands, once and once only, without retracing your steps?
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
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.
Prove that, given any three parallel lines, an equilateral triangle
always exists with one vertex on each of the three lines.
Take any two numbers between 0 and 1. Prove that the sum of the
numbers is always less than one plus their product?
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?
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.
Blue Flibbins are so jealous of their red partners that they will
not leave them on their own with any other bue Flibbin. What is the
quickest way of getting the five pairs of Flibbins safely to. . . .
Janine noticed, while studying some cube numbers, that if you take
three consecutive whole numbers and multiply them together and then
add the middle number of the three, you get the middle number. . . .
The problem is how did Archimedes calculate the lengths of the sides of the polygons which needed him to be able to calculate square roots?
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?
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?
Can you visualise whether these nets fold up into 3D shapes? Watch the videos each time to see if you were correct.
How many different cubes can be painted with three blue faces and
three red faces? A boy (using blue) and a girl (using red) paint
the faces of a cube in turn so that the six faces are painted. . . .
L triominoes can fit together to make larger versions of
themselves. Is every size possible to make in this way?
Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.
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. . . .
Clearly if a, b and c are the lengths of the sides of a triangle and the triangle is equilateral then
a^2 + b^2 + c^2 = ab + bc + ca. Is the converse true, and if so can you prove it? That is if. . . .
Which of these roads will satisfy a Munchkin builder?
Take any whole number q. Calculate q^2 - 1. Factorize
q^2-1 to give two factors a and b (not necessarily q+1 and q-1). Put c = a + b + 2q . Then you will find that ab+1 , bc+1 and ca+1 are all. . . .
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!
Can you rearrange the cards to make a series of correct
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.
The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.
A quadrilateral inscribed in a unit circle has sides of lengths s1, s2, s3 and s4 where s1 ≤ s2 ≤ s3 ≤ s4.
Find a quadrilateral of this type for which s1= sqrt2 and show s1 cannot. . . .
Four identical right angled triangles are drawn on the sides of a
square. Two face out, two face in. Why do the four vertices marked
with dots lie on one line?
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?
It is impossible to trisect an angle using only ruler and compasses
but it can be done using a carpenter's square.
Take any rectangle ABCD such that AB > BC. The point P is on AB
and Q is on CD. Show that there is exactly one position of P and Q
such that APCQ is a rhombus.
Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) =
ABCD is a square. P is the midpoint of AB and is joined to C. A line from D perpendicular to PC meets the line at the point Q. Prove AQ = AD.