| Diagonal Component | Formula | Square Sum | Square Root | Integer Status |
|---|
Scan bounded combinations of edges $(a, b, c)$ where $a < b < c$ to find new Euler bricks or integer face-pairs.
| (a, b, c) | d(ab) | d(ac) | d(bc) | Space (g) | Euler Brick? | Action |
|---|---|---|---|---|---|---|
| Click "Run Range Scan" or load presets above. | ||||||
The Mathematical Conundrum of the Perfect Cuboid
An Euler brick is a rectangular cuboid with integer edges $a, b, c$ such that all three face diagonals $d_{ab} = \sqrt{a^2+b^2}$, $d_{ac} = \sqrt{a^2+c^2}$, and $d_{bc} = \sqrt{b^2+c^2}$ are integers. The smallest such brick, discovered by Paul Halcke in 1719, has dimensions $(a,b,c) = (44, 117, 240)$ yielding face diagonals of $125, 244, 267$.
A perfect cuboid requires the internal space diagonal $g = \sqrt{a^2+b^2+c^2}$ to also be an integer. Exhaustive computer searches up to edge lengths exceeding $10^{12}$ have revealed zero instances, yet no mathematical proof exists proving their nonexistence.