Show that x = 1 is a solution of the equation x^(3/2) - 8x^(-3/2) = 7 and find all other solutions.
Here the diagram says it all. Can you find the diagram?
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.
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.
Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.
Professor Korner has generously supported school mathematics for more than 30 years and has been a good friend to NRICH since it started.
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 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.
A serious but easily readable discussion of proof in mathematics with some amusing stories and some interesting examples.
If you think that mathematical proof is really clearcut and universal then you should read this article.
Is the mean of the squares of two numbers greater than, or less than, the square of their means?
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.
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.
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.
L triominoes can fit together to make larger versions of themselves. Is every size possible to make in this way?
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.
These proofs are wrong. Can you see why?
If I tell you two sides of a right-angled triangle, you can easily work out the third. But what if the angle between the two sides is not a right angle?
Can you rearrange the cards to make a series of correct mathematical statements?
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?
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?
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?
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. . . .
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.
Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.
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.
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. . . .
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?
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?
Can you explain why a sequence of operations always gives you perfect squares?
An article which gives an account of some properties of magic 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.
Prove that in every tetrahedron there is a vertex such that the three edges meeting there have lengths which could be the sides of a triangle.
Which of these roads will satisfy a Munchkin builder?
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.
Some diagrammatic 'proofs' of algebraic identities and inequalities.
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.
Can you discover whether this is a fair game?
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.
In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).
Explore a number pattern which has the same symmetries in different bases.
Tom writes about expressing numbers as the sums of three squares.
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...
When if ever do you get the right answer if you add two fractions by adding the numerators and adding the denominators?
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.
Follow the hints and prove Pick's Theorem.