The 200-year-old mathematical puzzle that finally collapsed under the weight of a computer
In short: Leonhard Euler once conjectured that certain arrangements of symbols, known as Graeco-Latin squares, were impossible for specific grid sizes. This belief stood for over two centuries, shaping combinatorics until a team of researchers and a military computer finally proved him wrong in 1959, revealing a deeper, hidden mathematical reality.
A Graeco-Latin square is an n x n grid where each cell contains an ordered pair of symbols. These squares are constructed such that every row and column contains each symbol exactly once, and no pair is repeated. When decomposed, these form two orthogonal Latin squares, meaning the variables are perfectly independent—knowing one provides no information about the other. This concept is foundational to statistical blocking, ensuring variables remain free of confounding correlations.
Euler famously struggled with these arrangements, particularly the 'thirty-six officers problem,' which asked to arrange 36 officers from 6 regiments and 6 ranks so that no two officers shared a rank or regiment. Unable to solve it, he conjectured that no such squares existed for any order n where n equals 4k + 2. While the impossibility for order 6 was confirmed by Gaston Tarry in 1901, the broader conjecture held until 1959.
In April 1959, mathematicians Raj Chandra Bose, S. S. Shrikhande, and Ernest Parker published a paper disproving Euler’s conjecture for all n greater than or equal to 7. Parker utilized a UNIVAC 1206 computer to find a counterexample for order 10, marking one of the earliest instances of a combinatorics problem solved via digital computation. Remarkably, the concept had been discovered independently centuries earlier by the Korean statesman Choi Seok-jeong, who constructed an order 9 square around 1700, long before Euler’s formal treatment.
Modern research has extended these ideas into the quantum domain. In 2021, a team of physicists successfully constructed a quantum version of the 36 officers problem using entangled states. This discovery not only solved a long-standing generalization of Euler’s puzzle but also provided a new method for quantum error detection, allowing for the encoding of a 6-level system that can certify the occurrence of errors.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Mutually orthogonal Latin squares
To cite this card, link to https://intellectplus.co.uk/app/science-mutually-orthogonal-latin-squares.
How we source, check and correct cards: Editorial standards.
General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.
Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?
Related
More in Discrete mathematics · More in Science · Latest · A–Z · All topics