Skip over navigation
The NRICH Roadshow teacups problem represents a well-known object in maths. You may have heard about Latin squares before: they are arrangements of symbols (for example numbers) in a square grid so that every symbol occurs exactly once in every row and every column of the grid. The solution to a Sudoku puzzle forms a Latin square on a 9x9 grid in which every number from 1 to 9 occurs exactly once in each row and column.
A Graeco-Latin square is an arrangement of symbols in a square grid, which obeys the following rules:
”‹Graeco-Latin squares were studied extensively by Leonhard Euler, one of the most prolific mathematicians of all time, at the end of the 18th century. Euler was inspired by a puzzle called the 36 officers problem. Imagine there's a war and you're in command of an army that consists of six regiments, each containing six officers of six different ranks. Can you arrange the officers in a 6x6 square so that each row and each column of the square holds only one officer from each regiment and only one officer from each rank? In this case, the two “symbols” in each little square are the rank and regiment of an officer. The difference to the teacup puzzle is that here we are dealing with a 6x6 grid, rather than a 4x4 grid.
Euler gave a lot of thought to the 36 officers problem, and eventually concluded that, “We have to admit that such an arrangement is impossible, though we can't give a rigorous demonstration of this". A proof that the problem is impossible to solve didn't come along until nearly 130 years later, when the French mathematician Gaston Terry provided it in 1901.
So what about our teacup puzzle? As you may already have found out, a solution does exist in this case. It would be cruel to present you with an unsolvable problem! In fact, there are a total of 1152 solutions. Once you have found one solution, you can immediately generate others: simply rotate or reflect the arrangement and the result is also a solution.
These solutions (involving only the saucers, so they form a Latin square - we don't want to give the whole solution away) look different, but they are related through rotations: rotate the first solution by 90 degrees clockwise and you get the second (top right), another 90 degree rotation gives the third solution (bottom left), and another gives the fourth (bottom right).
If you consider solutions related by such symmetries to be the same, because essentially they are, then the number of solutions shrinks to 144. The idea that problems and their solutions can exhibit symmetries is an important one in mathematics and theoretical physics, and often provides a powerful tool, not only to solve problems, but also to sniff out new lines of inquiry.
What if we are dealing with five sets of cups and saucers, or six, seven, or any other positive number? In that case we would be looking for a 5 x 5, 6 x 6, 7 x 7, or, more generally, an n x n Graeco-Latin square. Euler showed that n x n Graeco-Latin squares exist for all odd numbers n and for all numbers n that are divisible by 4. The number n = 6 doesn't belong to either of these classes, and as we have seen with the 36 officer problem above, a 6 x 6 Graeco-Latin square doesn't exist. Euler believed that the same was true for any even number n that is not divisible by 4. In other words, that there is no n x n Graeco-Latin square for n = 6, n = 10, n = 14, etc. So did many other people, until Euler was proved wrong in 1960. The mathematicians Bose, Shrikhande and Parker enlisted the help of computers to prove that Graeco-Latin squares exist for all n except 2 and 6.
But Euler's work on Graeco-Latin squares wasn't a failure. As one would expect from a great mathematician, he persevered, and even though his conclusion was wrong, he came up with interesting and important new ideas in the process of tackling the problem. The 36 officer problem inspired Euler to contribute important work to an area of maths called combinatorics which, as you may have guessed, is about combining objects in ways that satisfy particular constraints. It has many applications in the real world - from designing schedules, such as school timetables or sports tournaments, to detecting patterns, for example in DNA sequences or large amounts of data.
This article is based on material written by Marianne Freiberger and Rachel Thomas, editors of Plus, the free online mathematics magazine produced by the Millennium Mathematics Project at the University of Cambridge.
Teacups: A Maths Challenge with History
The NRICH Roadshow teacups problem represents a well-known object in maths. You may have heard about Latin squares before: they are arrangements of symbols (for example numbers) in a square grid so that every symbol occurs exactly once in every row and every column of the grid. The solution to a Sudoku puzzle forms a Latin square on a 9x9 grid in which every number from 1 to 9 occurs exactly once in each row and column.
Our tea cups are slightly more challenging. Once you have solved the problem, the grid of cups and saucers form a Graeco-Latin square, in which there are two objects in every little square of the grid. Generally, mathematicians use symbols rather than cups and saucers when they construct such squares. Here is an example using letters and numbers:
A Graeco-Latin square is an arrangement of symbols in a square grid, which obeys the following rules:
- Each square of the grid contains a pair of symbols, one from each of two kinds (one letter, one number).
- In every column of the grid, every symbol occurs exactly once. And the same is true for each row. (Each number, and each letter, exactly once in every column and every row).
- Every possible pair of objects occurs exactly once in the entire grid.
”‹Graeco-Latin squares were studied extensively by Leonhard Euler, one of the most prolific mathematicians of all time, at the end of the 18th century. Euler was inspired by a puzzle called the 36 officers problem. Imagine there's a war and you're in command of an army that consists of six regiments, each containing six officers of six different ranks. Can you arrange the officers in a 6x6 square so that each row and each column of the square holds only one officer from each regiment and only one officer from each rank? In this case, the two “symbols” in each little square are the rank and regiment of an officer. The difference to the teacup puzzle is that here we are dealing with a 6x6 grid, rather than a 4x4 grid.
Euler gave a lot of thought to the 36 officers problem, and eventually concluded that, “We have to admit that such an arrangement is impossible, though we can't give a rigorous demonstration of this". A proof that the problem is impossible to solve didn't come along until nearly 130 years later, when the French mathematician Gaston Terry provided it in 1901.
So what about our teacup puzzle? As you may already have found out, a solution does exist in this case. It would be cruel to present you with an unsolvable problem! In fact, there are a total of 1152 solutions. Once you have found one solution, you can immediately generate others: simply rotate or reflect the arrangement and the result is also a solution.
These solutions (involving only the saucers, so they form a Latin square - we don't want to give the whole solution away) look different, but they are related through rotations: rotate the first solution by 90 degrees clockwise and you get the second (top right), another 90 degree rotation gives the third solution (bottom left), and another gives the fourth (bottom right).
If you consider solutions related by such symmetries to be the same, because essentially they are, then the number of solutions shrinks to 144. The idea that problems and their solutions can exhibit symmetries is an important one in mathematics and theoretical physics, and often provides a powerful tool, not only to solve problems, but also to sniff out new lines of inquiry.
What if we are dealing with five sets of cups and saucers, or six, seven, or any other positive number? In that case we would be looking for a 5 x 5, 6 x 6, 7 x 7, or, more generally, an n x n Graeco-Latin square. Euler showed that n x n Graeco-Latin squares exist for all odd numbers n and for all numbers n that are divisible by 4. The number n = 6 doesn't belong to either of these classes, and as we have seen with the 36 officer problem above, a 6 x 6 Graeco-Latin square doesn't exist. Euler believed that the same was true for any even number n that is not divisible by 4. In other words, that there is no n x n Graeco-Latin square for n = 6, n = 10, n = 14, etc. So did many other people, until Euler was proved wrong in 1960. The mathematicians Bose, Shrikhande and Parker enlisted the help of computers to prove that Graeco-Latin squares exist for all n except 2 and 6.
But Euler's work on Graeco-Latin squares wasn't a failure. As one would expect from a great mathematician, he persevered, and even though his conclusion was wrong, he came up with interesting and important new ideas in the process of tackling the problem. The 36 officer problem inspired Euler to contribute important work to an area of maths called combinatorics which, as you may have guessed, is about combining objects in ways that satisfy particular constraints. It has many applications in the real world - from designing schedules, such as school timetables or sports tournaments, to detecting patterns, for example in DNA sequences or large amounts of data.
This article is based on material written by Marianne Freiberger and Rachel Thomas, editors of Plus, the free online mathematics magazine produced by the Millennium Mathematics Project at the University of Cambridge.