Euler brick
Generated by GPT-5-miniExpansion Funnel Raw 70 → Dedup 21 → NER 11 → Enqueued 10
| Euler brick | |
|---|---|
| Name | Euler brick |
| Caption | Right rectangular prism with integer edge lengths and integer face diagonals |
| Field | Number theory |
| Introduced | 18th century |
| Discovered by | Leonhard Euler |
Euler brick An Euler brick is a right rectangular prism whose three edge lengths and three face diagonals are all integers. Originating in the study of Diophantine equations by Leonhard Euler, the problem connects to classical results in Pythagorean theorem, Diophantine analysis, and computational searches carried out by researchers affiliated with institutions such as Princeton University, University of Cambridge, and Institute for Advanced Study. The subject interacts with problems studied by figures like Pierre de Fermat, Srinivasa Ramanujan, Joseph-Louis Lagrange, and modern contributors at organizations including Microsoft Research, Los Alamos National Laboratory, and Google.
Definition and basic properties
An Euler brick is defined by three positive integers a, b, c (edge lengths) for which the three face diagonals sqrt(a^2 + b^2), sqrt(a^2 + c^2), sqrt(b^2 + c^2) are integers. This requirement links to Pythagorean triples first systematized by Euclid and later generalized by Diophantus of Alexandria. Each pair (a,b), (a,c), (b,c) must form a Pythagorean triple related to parametric formulas appearing in the work of Euclid (mathematician), Pythagoras, and studied by Fermat in his investigations of sums of squares. The algebraic structure can be rephrased as simultaneous quadratic Diophantine equations akin to those appearing in Lagrange's four-square theorem and in the theory developed by Carl Friedrich Gauss. Symmetries of the rectangular prism induce permutations corresponding to actions studied in Group theory by researchers at École Normale Supérieure and Harvard University.
Examples and known Euler bricks
Classical small examples include integer triples such as (44, 117, 240), (85, 132, 720), and (240, 117, 44) discovered or cataloged in studies influenced by Leonhard Euler and later enumerated by researchers at University of Oxford and MIT. These examples satisfy integer face diagonals: for (44,117,240) the face diagonals correspond to Pythagorean triples long known since work by Pythagoreans and compiled in tables by Adrien-Marie Legendre. Catalogues have been maintained by mathematicians at University of California, Berkeley and Wolfram Research. Larger examples were found in computational projects involving contributors from Stanford University and ETH Zurich. Historical contributions come from scholars associated with Royal Society publications and entries in journals such as Acta Arithmetica.
Parametrizations and construction methods
Parametrizations of Euler bricks build on the parametric form for primitive Pythagorean triples popularized in the works of Euclid and formalized by Diophantus of Alexandria and Fermat. One approach uses pairs of coprime integer parameters (m,n) producing edge relations via formulas reminiscent of those in Euclid's Elements and later generalized by Srinivasa Ramanujan. Algebraic manipulations employ methods from Quadratic forms and the theory of rational points on algebraic varieties studied by André Weil, Yuri Manin, and researchers at Max Planck Institute for Mathematics. Some constructions exploit identities related to sums of two squares traced back to Fermat's theorem on sums of two squares and to techniques from Algebraic number theory developed by Richard Dedekind and Ernst Kummer. Parametric families have been published in journals associated with Cambridge University Press and explored in dissertations at Princeton University.
Perfect cuboid problem
The perfect cuboid problem asks whether there exists a right rectangular prism with integer edge lengths, integer face diagonals, and integer space diagonal simultaneously — a question famously associated with Leonhard Euler and examined in the tradition initiated by Pierre de Fermat. This open problem sits alongside other unresolved questions such as Goldbach conjecture and Birch and Swinnerton-Dyer conjecture in the landscape of unsolved problems catalogued by organizations like Clay Mathematics Institute. Partial results eliminate many parameter ranges using methods from algebraic geometry and computational techniques developed at Los Alamos National Laboratory and Lawrence Berkeley National Laboratory. Connections to the arithmetic of elliptic curves studied by Andrew Wiles and Gerd Faltings provide deep frameworks, while heuristic analyses reference techniques from analytic number theory advanced by Atle Selberg and Hans Rademacher.
Computational searches and results
Extensive computer searches by teams at Wolfram Research, Microsoft Research, University of Waterloo, and citizen-science projects coordinated via distributed computing platforms have cataloged Euler bricks up to large bounds. These computations leverage algorithms arising from work at Bell Labs and complexity theory studied at Massachusetts Institute of Technology and Carnegie Mellon University. Results include large lists of solutions, optimizations using lattice reduction algorithms tied to research by Hermann Minkowski, and use of sieving techniques influenced by developments at Institut des Hautes Études Scientifiques. No perfect cuboid has been found despite searches employing supercomputers at Oak Ridge National Laboratory and grids maintained by European Grid Infrastructure.
Applications and related problems
Euler bricks intersect with problems in integer lattice theory relevant to work at Courant Institute of Mathematical Sciences and to crystallography studies at Max Planck Institute for Solid State Research. Related Diophantine problems include rational cuboids, Heronian tetrahedra, and rational distance sets investigated by researchers at University of Cambridge and Imperial College London. The topic informs algorithmic number theory curricula at ETH Zurich and University of Tokyo and appears in outreach materials from Smithsonian Institution and American Mathematical Society. Connections extend to modern research in cryptanalysis and coding theory developed at National Security Agency and NIST, where integer lattice problems play roles analogous to the combinatorial structures encountered in Euler-brick constructions.