Euler brick

From Wikipedia, the free encyclopedia

In mathematics, an Euler Brick, named after the famous mathematician Leonhard Euler, is a cuboid with integer edges and also integer face diagonals. A primitive Euler Brick is an Euler brick with its edges relatively prime.

Alternatively stated, an Euler Brick is a solution to the following system of diophantine equations

a² + b² = d²

b² + c² = e²

a² + c² = f²

The smallest Euler brick has edges

(a,b,c) = (240,117,44)

and face polyhedron diagonals

267, 244, and 125.

Paul Halcke discovered it in 1719.

Other solutions are: Given as: length (a, b, c)

(275, 252, 240), (693, 480, 140), (720, 132, 85), (792, 231, 160)

Euler found at least two parametric solutions to the problem.

[edit] Perfect cuboid

A perfect cuboid (also called a perfect box) is an Euler brick whose body diagonal is also an integer.

In other words the following equation is added to the above diophantine equation

a² + b² + c² = g²

Some interesting facts about a perfect cuboid.

• 2 edges must be even and 1 edge must be odd (for a primitive perfect cuboid).
• 1 edge must be divisible by 4 and 1 edge must be divisible by 16
• 1 edge must be divisible by 3 and 1 edge must be divisible by 9
• 1 edge must be divisible by 5
• 1 edge must be divisible by 11

As of 2005, no example of a perfect cuboid had been found and no one had proven that it cannot exist. Exhaustive computer searches have proven that the smallest edge of the perfect box is at least 4.3 billion. Solutions have been found where the body 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.

[edit] References

• Weisstein, Eric W., Euler Brick at MathWorld.