Thirty-six officers problem

Thirty-six officers problem

C007/6206 Rights Managed

Request low-res file

530 pixels on longest edge, unwatermarked

Request/Download high-res file

Uncompressed file size: 50.2MB

Downloadable file size: 1.2MB

Price image Pricing

Please login to use the price calculator


Caption: Thirty-six officers problem. This problem was devised in 1779 by the Swiss mathematician Leonhard Euler (1707-1783). Euler asked if six regiments (colours), with men of six different ranks (pips on shoulder tabs), could be arranged in a 6x6 square so that each row and column would not repeat a rank or regiment. Known as a Graeco-Latin square, this is a form of combinatorics. Latin squares, such as Sudoku, involve non-repetition of one property rather than two. Euler said there was no solution to this problem, but this was not proven until 1901. In 1960, it was shown that all Graeco-Latin squares except the 2x2 and 6x6 cases can be solved.

Release details: Model release not required. Property release not required.

Keywords: 1700s, 1779, 18th century, array, artwork, combination, combinations, combinatorics, conjecture, diagram, graeco-latin square, grid, illustration, leonhard euler, mathematical, mathematics, maths problems, military, problem, puzzle, rank, ranks, regiment, regiments, shoulder pips, soldier, soldiers, square, tab, tabs, thirty six officers problem

Licence fees: A licence fee will be charged for any media (low or high resolution) used in your project.