Euler brick

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.

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

Definition

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. Euler found at least two parametric solutions to the problem, but neither gives all solutions.[1]

Properties

If (a, b, c) is a solution, then (ka, kb, kc) is also a solution for any k. Consequently, the solutions in rational numbers are all rescalings of integer solutions.

Given an Euler brick with edge-lengths (a, b, c), the triple (bc, ac, ab) constitutes an Euler brick as well.[2]:p. 106

At least two edges of an Euler brick are divisible by 3.[2]:p. 106

At least two edges of an Euler brick are divisible by 4.[2]:p. 106

At least one edge of an Euler brick is divisible by 11.[2]:p. 106

Generating formula

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

give face diagonals

Examples

The smallest Euler brick, discovered by Paul Halcke in 1719, has edges (a, b, c) = (44, 117, 240) and face diagonals (125, 244, 267).

Some other small primitive solutions, given as edges (a, b, c) — face diagonals (d, e, f), are below:

Perfect cuboid

Unsolved problem in mathematics:
Does a perfect cuboid exist?
(more unsolved problems in mathematics)

A perfect cuboid (also called a 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 2015, no example of a perfect cuboid had been found and no one has proven that none exist.

Exhaustive computer searches show that, if a perfect cuboid exists, one of its edges must be greater than 3×1012.[3][4] Furthermore, its smallest edge must be longer than 1010.[5]

It has recently been shown by exhaustive computer search that the odd edge must be at least 2.5 × 1013.[6]

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:

Solutions have been found where the space 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, such as:

(a, b, c) = (18720, 211773121, 7800)

and

(a, b, c) = (520, 576, 618849).

There is no cuboid with integer space diagonal and successive integers for edges.[2]:p.99

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

See also

Notes

  1. Weisstein, Eric W. "Euler Brick". MathWorld.
  2. 1 2 3 4 5 6 7 Wacław Sierpiński, Pythagorean Triangles, Dover Publications, 2003 (orig. ed. 1962).
  3. Durango Bill. The “Integer Brick” Problem
  4. Weisstein, Eric W. "Perfect Cuboid". MathWorld.
  5. Randall Rathbun, Perfect Cuboid search to 1e10 completed - none found. NMBRTHRY maillist, November 28, 2010.
  6. R Matson, Results of a Computer Search for a Perfect Cuboid, http://unsolvedproblems.org/S58.pdf
  7. M. Kraitchik, On certain Rational Cuboids, Scripta Mathematica, volume 11 (1945).
  8. Sawyer, Jorge F.; Reiter, Clifford A. (2011). "Perfect parallelepipeds exist". Mathematics of Computation. 80: 1037–1040. arXiv:0907.0220Freely accessible. doi:10.1090/s0025-5718-2010-02400-7..

References


This article is issued from Wikipedia - version of the 11/15/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.