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. A perfect Euler brick is one whose space diagonal is also an integer, but such a brick has not yet been found.

Euler brick with edges a, b, c and face diagonals d, e, f


The definition of an Euler brick in geometric terms is equivalent to a solution to the following system of Diophantine equations:

where a, b, c are the edges and d, e, f are the diagonals.



The smallest Euler brick, discovered by Paul Halcke in 1719, has edges (a, b, c) = (44, 117, 240) and face diagonals (d, e, f ) = (125, 244, 267).[2] Some other small primitive solutions, given as edges (a, b, c) — face diagonals (d, e, f), are below:

All five primitive Euler bricks with dimensions under 1000
( 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 )

Generating formula

Euler found at least two parametric solutions to the problem, but neither gives all solutions.[3]

An infinitude of Euler bricks can be generated with Saunderson's[4] parametric formula. Let (u, v, w) be a Pythagorean triple (that is, u2 + v2 = w2.) Then[1]: 105  the edges

give face diagonals

There are many Euler bricks which are not parametrized as above, for instance the Euler brick with edges (a, b, c) = (240, 252, 275) and face diagonals (d, e, f ) = (348, 365, 373).

Perfect cuboid

Unsolved problem in mathematics:

Does a perfect cuboid exist?

A perfect cuboid (also called a perfect Euler brick or 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. As of May 2023, no example of a perfect cuboid had been found and no one has proven that none exist.[5]

Euler brick with edges a, b, c and face diagonals d, e, f

Exhaustive computer searches show that, if a perfect cuboid exists,

Some facts are known about properties that must be satisfied by a primitive perfect cuboid, if one exists, based on modular arithmetic:[7]

In addition:

If a perfect cuboid exists and are its edges, — the corresponding face diagonals and the space diagonal , then

Cuboid conjectures

Three cuboid conjectures are three mathematical propositions claiming irreducibility of three univariate polynomials with integer coefficients depending on several integer parameters. The conjectures are related to the perfect cuboid problem.[11][12] Though they are not equivalent to the perfect cuboid problem, if all of these three conjectures are valid, then no perfect cuboids exist. They are neither proved nor disproved.

Cuboid conjecture 1. For any two positive coprime integer numbers the eighth degree polynomial






is irreducible over the ring of integers .

Cuboid conjecture 2. For any two positive coprime integer numbers the tenth-degree polynomial






is irreducible over the ring of integers .

Cuboid conjecture 3. For any three positive coprime integer numbers , , such that none of the conditions






are fulfilled, the twelfth-degree polynomial






is irreducible over the ring of integers .

Almost-perfect cuboids

An almost-perfect cuboid has 6 out of the 7 lengths as rational. Such cuboids can be sorted into three types, called body, edge, and face cuboids.[13] In the case of the body cuboid, the body (space) diagonal g is irrational. For the edge cuboid, one of the edges a, b, c is irrational. The face cuboid has one of the face diagonals d, e, f irrational.

The body cuboid is commonly referred to as the Euler cuboid in honor of Leonhard Euler, who discussed this type of cuboid.[14] He was also aware of face cuboids, and provided the (104, 153, 672) example.[15] The three integer cuboid edge lengths and three integer diagonal lengths of a face cuboid can also be interpreted as the edge lengths of a Heronian tetrahedron that is also a Schläfli orthoscheme. There are infinitely many face cuboids, and infinitely many Heronian orthoschemes.[16]

The smallest solutions for each type of almost-perfect cuboids, given as edges, face diagonals and the space diagonal (a, b, c, d, e, f, g), are as follows:

As of July 2020, there are 167,043 found cuboids with the smallest integer edge less than 200,000,000,027: 61,042 are Euler (body) cuboids, 16,612 are edge cuboids with a complex number edge length, 32,286 were edge cuboids, and 57,103 were face cuboids.[17]

As of December 2017, an exhaustive search counted all edge and face cuboids with the smallest integer space diagonal less than 1,125,899,906,842,624: 194,652 were edge cuboids, 350,778 were face cuboids.[6]

Perfect parallelepiped

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,[18] answering an open question of Richard Guy. Some of these perfect parallelepipeds have two rectangular faces. The smallest perfect parallelepiped has edges 271, 106, and 103; short face diagonals 101, 266, and 255; long face diagonals 183, 312, and 323; and body diagonals 374, 300, 278, and 272.

See also


  1. ^ a b c d e Wacław Sierpiński, Pythagorean Triangles, Dover Publications, 2003 (orig. ed. 1962).
  2. ^ Visions of Infinity: The Great Mathematical Problems By Ian Stewart, Chapter 17
  3. ^ Weisstein, Eric W. "Euler Brick". MathWorld.
  4. ^ Knill, Oliver (February 24, 2009). "Treasure Hunting Perfect Euler bricks" (PDF). Math table. Harvard University.
  5. ^ a b c Matson, Robert D. "Results of a Computer Search for a Perfect Cuboid" (PDF). Retrieved February 24, 2020.
  6. ^ a b Alexander Belogourov, Distributed search for a perfect cuboid,
  7. ^ M. Kraitchik, On certain Rational Cuboids, Scripta Mathematica, volume 11 (1945).
  8. ^ a b I. Korec, Lower bounds for Perfect Rational Cuboids, Math. Slovaca, 42 (1992), No. 5, p. 565-582.
  9. ^ Ronald van Luijk, On Perfect Cuboids, June 2000
  10. ^ Florian Luca (2000) "Perfect Cuboids and Perfect Square Triangles", Mathematics Magazine, 73:5, p. 400-401
  11. ^ Sharipov R.A. (2012). "Perfect cuboids and irreducible polynomials". Ufa Math Journal. 4 (1): 153–160. arXiv:1108.5348. Bibcode:2011arXiv1108.5348S.
  12. ^ Sharipov R.A. (2015). "Asymptotic approach to the perfect cuboid problem". Ufa Math Journal. 7 (3): 100–113. doi:10.13108/2015-7-3-95.
  13. ^ Rathbun R. L., Granlund Т., The integer cuboid table with body, edge, and face type of solutions // Math. Comp., 1994, Vol. 62, P. 441-442.
  14. ^ Euler, Leonhard, Vollst¨andige Anleitung zur Algebra, Kayserliche Akademie der Wissenschaften, St. Petersburg, 1771
  15. ^ Euler, Leonhard, Vollst¨andige Anleitung zur Algebra, 2, Part II, 236, English translation: Euler, Elements of Algebra, Springer-Verlag 1984
  16. ^ "Problem 930" (PDF), Solutions, Crux Mathematicorum, 11 (5): 162–166, May 1985
  17. ^ Rathbun, Randall L. (14 Jul 2020). "The Integer Cuboid Table". arXiv:1705.05929v4 [math.NT].
  18. ^ Sawyer, Jorge F.; Reiter, Clifford A. (2011). "Perfect parallelepipeds exist". Mathematics of Computation. 80 (274): 1037–1040. arXiv:0907.0220. doi:10.1090/s0025-5718-2010-02400-7. S2CID 206288198..