Perfect Cuboid Problem: The Box Nobody Can Find
Quick answer: A perfect cuboid is a rectangular box whose three edges, three face diagonals and space diagonal are all whole numbers. Nobody knows if one exists. Boxes with whole-number edges and face diagonals, called Euler bricks, do exist, such as the classic 44 × 117 × 240 (Paul Halcke, 1719). Computer searches show any perfect cuboid would need its smallest edge above 500 billion.
Build a shoebox where every measurement is a whole number: the length, width and height, the diagonal across each face, and the long diagonal from one corner through the middle to the opposite corner. It sounds like a simple craft project. In fact, no one has ever found such a box, and no one has proved it is impossible.
Seven Lengths, Seven Equations
For a box with edges \(a, b, c\), the Pythagorean theorem gives the face diagonals \(d, e, f\) and the space diagonal \(g\):
\[ a^2 + b^2 = d^2, \quad a^2 + c^2 = e^2, \quad b^2 + c^2 = f^2, \quad a^2 + b^2 + c^2 = g^2. \]
A perfect cuboid needs all seven numbers \(a, b, c, d, e, f, g\) to be positive integers.
Euler Bricks: So Close
Drop the last condition and you get an Euler brick: whole-number edges and face diagonals. The smallest (ordered by its longest edge), found by Paul Halcke in 1719, has edges 44, 117 and 240:
| Diagonal | Calculation | Length |
|---|---|---|
| Face 44 by 117 | \(1936 + 13689 = 15625\) | 125 |
| Face 44 by 240 | \(1936 + 57600 = 59536\) | 244 |
| Face 117 by 240 | \(13689 + 57600 = 71289\) | 267 |
| Space diagonal | \(1936 + 13689 + 57600 = 73225\) | \(\sqrt{73225} \approx 270.6\), not whole, since \(270^2 = 72900 < 73225 < 73441 = 271^2\) |
Nicholas Saunderson found a formula that turns any Pythagorean triple into an Euler brick, so there are infinitely many. Euler and others studied them further. The trouble is always that last space diagonal.
Almost Perfect Cuboids
Mathematicians have found boxes where six of the seven lengths are whole numbers, missing one in different places:
| Type | Missing | Smallest example |
|---|---|---|
| Body cuboid (Euler brick) | Space diagonal | 44, 117, 240 |
| Edge cuboid | One edge | Edges 520, 576 and \(\sqrt{618849}\); space diagonal 1105 |
| Face cuboid | One face diagonal | 104, 153, 672; space diagonal 697 |
Each near miss makes the full version feel within reach, yet no perfect cuboid has turned up.
What Is Known
- Reported computational bounds: Robert Matson reported in 2015 that any perfect cuboid must have its smallest edge above 500 billion (\(5 \times 10^{11}\)) and, for a primitive one, its odd edge above 25 trillion (\(2.5 \times 10^{13}\)). The yoyo@home distributed project reported in 2018 that the space diagonal must exceed \(2^{53} \approx 9 \times 10^{15}\). These are finite searches, not impossibility proofs.
- Divisibility (for a primitive cuboid, whose edges share no common factor): one edge must be divisible by 16 and another by 4; two edges must be divisible by 3, one of them by 9; and for each of 5, 7, 11 and 19, some edge must be divisible by it (one edge may carry several). The space diagonal must be odd.
- Recent work: a 2024 paper by Aubrey de Grey, Philip Gibbs and Louie Helm found new required properties and faster search methods. In April 2026, René Peschmann recast the problem with algebraic curves and proved partial obstructions, then reported excluding 1,072 parameter families; a September 2026 preprint by Cipollini reports excluding the remaining 968 families in the same bounded range. These rule out families of candidates within limits, not perfect cuboids in general.
As of November 2026, the existence of a perfect cuboid is open.
Common Misconceptions
“Euler bricks are perfect cuboids.” No. An Euler brick only needs whole-number face diagonals; its space diagonal is not a whole number in any known example.
“A computer search proved there are none.” Searches only rule out boxes below a size limit. A perfect cuboid could still exist with larger edges.
Watch: The Perfect Cuboid Problem in Video
If you learn better by watching, these videos are worth your time.
Check Your Understanding
Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.
Answer each question and press Submit to see your result right away.
Frequently Asked Questions
What is a perfect cuboid?
A rectangular box whose edges, face diagonals and space diagonal are all whole numbers. None is known.
Does a perfect cuboid exist?
Nobody knows. None has been found, and no proof rules one out. Computer searches show any example must be enormous.
What is an Euler brick?
A box with whole-number edges and face diagonals. The smallest is 44 × 117 × 240, with face diagonals 125, 244 and 267.
How big would a perfect cuboid have to be?
Its smallest edge would have to exceed 500 billion and its odd edge 25 trillion, according to computer searches reported in 2015.
Keep Exploring
- Sum of Three Cubes: 42 Solved, 114 Still Open
- Do Odd Perfect Numbers Exist? What We Know in 2026
- Fermat’s Last Theorem Explained: Wiles to Lean
Sources and Further Reading
- Robert D. Matson, Results of a computer search for a perfect cuboid (PDF)
- de Grey, Gibbs and Helm, Novel required properties of, and efficient algorithms to seek, perfect cuboids (arXiv)
- René Peschmann, Quartic reductions and elliptic obstructions for perfect Euler bricks (arXiv, 2026)
- Wikipedia: Euler brick
Related to This Article
More math articles
- Area of Rectangles for 4th Grade
- Advanced Vocabulary Words: Chasm to Concoct
- How to Graph the Cosine Function?
- Free Grade 4 English Worksheets for SBAC Students
- Ethnocentrism, Relativism, and Cross-Cultural Encounters
- The Best Grade 5 ELA Practice Tests for Oklahoma Students
- How to Tell If a Graph Is a Function: Vertical Line Test
- What skills Do I need for the GED Math Test?
- Grade 3 Math: Comparing and Ordering Numbers
- How to Calculate Unit Prices and Total Price


What people say about "Perfect Cuboid Problem: The Box Nobody Can Find - Effortless Math"?
No one replied yet.