In mathematics, an Euler brick, named after Leonhard Euler, is a rectangular cuboid whose edges and face diagonals all have integer lengths. A primitive Euler brick is an Euler brick whose edge lengths are relatively prime.
The definition of an Euler brick in geometric terms is equivalent to a solution to the following system of Diophantine equations:
If (a, b, c) is a solution, then (ka, kb, kc) is also a solution for any k. Consequently, the solutions in rational numbers are all rescalings of integer solutions.
Given an Euler brick with edge-lengths (a, b, c), the triple (bc, ac, ab) constitutes an Euler brick as well.:p. 106
At least two edges of an Euler brick are divisible by 3.:p. 106
At least two edges of an Euler brick are divisible by 4.:p. 106
At least one edge of an Euler brick is divisible by 11.:p. 106
give face diagonals
The smallest Euler brick, discovered by Paul Halcke in 1719, has edges (a, b, c) = (44, 117, 240) and face diagonals (125, 244, 267).
Some other small primitive solutions, given as edges (a, b, c) — face diagonals (d, e, f), are below:
- (85, 132, 720) — (157, 725, 732);
- (140, 480, 693) — (500, 707, 843);
- (160, 231, 792) — (281, 808, 825);
- (187, 1020, 1584) — (1037, 1595, 1884);
- (195, 748, 6336) — (773, 6339, 6380);
- (240, 252, 275) — (348, 365, 373);
- (429, 880, 2340) — (979, 2379, 2500);
- (495, 4888, 8160) — (4913, 8175, 9512);
- (528, 5796, 6325) — (5820, 6347, 8579) ;
|Unsolved problem in mathematics:
Does a perfect cuboid exist?
(more unsolved problems in mathematics)
A perfect cuboid (also called a perfect box) is an Euler brick whose space diagonal also has integer length.
In other words, the following equation is added to the system of Diophantine equations defining an Euler brick:
where g is the space diagonal. Thus (a, b, c, g) must be a Pythagorean quadruple. As of May 2015[update], no example of a perfect cuboid had been found and no one has proven that none exist. Exhaustive computer searches show that, if a perfect cuboid exists, one of its edges must be greater than ×1012. 3 Furthermore, its smallest edge must be longer than 1010.
It has recently been shown by exhaustive computer search that the odd edge must be at least 2.5 * 1013. 
Some facts are known about properties that must be satisfied by a primitive perfect cuboid, if one exists, based on modular arithmetic: 
- One edge, two face diagonals and the body diagonal must be odd, one edge and the remaining face diagonal must be divisible by 4, and the remaining edge must be divisible by 16.
- Two edges must have length divisible by 3 and at least one of those edges must have length divisible by 9.
- One edge must have length divisible by 5.
- One edge must have length divisible by 7.
- One edge must have length divisible by 11.
- One edge must have length divisible by 19.
- One edge or space diagonal must be divisible by 13.
- One edge, face diagonal or space diagonal must be divisible by 17.
- One edge, face diagonal or space diagonal must be divisible by 29.
- One edge, face diagonal or space diagonal must be divisible by 37.
- The space diagonal cannot be a power of 2 or 5 times a power of 2.:p. 101
Solutions have been found where the space diagonal and two of the three face diagonals are integers, such as:
- (a, b, c) = (672, 153, 104).
Solutions are also known where all four diagonals but only two of the three edges are integers, such as:
- (a, b, c) = (18720, √, 7800)
- (a, b, c) = (520, 576, √).
There is no cuboid with integer space diagonal and successive integers for edges.:p.99
A perfect parallelepiped is a parallelepiped with integer-length edges, face diagonals, and body diagonals, but not necessarily with all right angles; a perfect cuboid is a special case of a perfect parallelepiped. In 2009, dozens of perfect parallelepipeds were shown to exist, answering an open question of Richard Guy. A small example has edges 271, 106, and 103, face diagonals 101, 266, 255, 183, 312, and 323, and body diagonals 374, 300, 278, and 272. Some of these perfect parallelepipeds have two rectangular faces.
- Weisstein, Eric W., "Euler Brick", MathWorld.
- Wacław Sierpiński, Pythagorean Triangles, Dover Publications, 2003 (orig. ed. 1962).
- Durango Bill. The “Integer Brick” Problem
- Weisstein, Eric W., "Perfect Cuboid", MathWorld.
- Randall Rathbun, Perfect Cuboid search to 1e10 completed - none found. NMBRTHRY maillist, November 28, 2010.
- R Matson, Results of a Computer Search for a Perfect Cuboid, http://unsolvedproblems.org/S58.pdf
- M. Kraitchik, On certain Rational Cuboids, Scripta Mathematica, volume 11 (1945).
- Sawyer, Jorge F.; Reiter, Clifford A. (2011). "Perfect parallelepipeds exist". Mathematics of Computation. 80: 1037–1040. arXiv:. doi:10.1090/s0025-5718-2010-02400-7..
- Leech, John (1977). "The Rational Cuboid Revisited". American Mathematical Monthly. 84 (7): 518–533. doi:10.2307/2320014. JSTOR 2320014.
- Shaffer, Sherrill (1987). "Necessary Divisors of Perfect Integer Cuboids". Abstracts of the American Mathematical Society. 8(6): 440.
- Guy, Richard K. (2004). Unsolved Problems in Number Theory. Springer-Verlag. pp. 275–283. ISBN 0-387-20860-7.
- Kraitchik, M. (1945). "On certain rational cuboids". Scripta Mathematica. 11: 317–326.
- Roberts, Tim (2010). "Some constraints on the existence of a perfect cuboid". Australian Mathematical Society Gazette. 37: 29–31. ISSN 1326-2297.