Euler brick

Last updated

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. A perfect Euler brick is one whose space diagonal is also an integer, but such a brick has not yet been found.

Contents

Euler brick with edges a, b, c and face diagonals d, e, f Euler brick.svg
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.

Properties

Examples

The smallest Euler brick, discovered by Paul Halcke in 1719, has edges (a, b, c) = (44, 117, 240) and face diagonals (d, e, f ) = (125, 244, 267). [2] Some other small primitive solutions, given as edges (a, b, c) — face diagonals (d, e, f), are below:

All five primitive Euler bricks with dimensions under 1000 Euler brick examples.svg
All five primitive Euler bricks with dimensions under 1000
(85,132,720) — (157,725,732)
(140,480,693) — (500,707,843)
(160,231,792) — (281,808,825)
(187,1020,1584) — (1037,1595,1884)
(195,748,6336) — (773,6339,6380)
(240,252,275) — (348,365,373)
(429,880,2340) — (979,2379,2500)
(495,4888,8160) — (4913,8175,9512)
(528,5796,6325) — (5820,6347,8579)

Generating formula

Euler found at least two parametric solutions to the problem, but neither gives all solutions. [3]

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

give face diagonals

There are many Euler bricks which are not parametrized as above, for instance the Euler brick with edges (a, b, c) = (240, 252, 275) and face diagonals (d, e, f ) = (348, 365, 373).

Perfect cuboid

Unsolved problem in mathematics:
Does a perfect cuboid exist?

A perfect cuboid (also called a perfect Euler brick or 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 March 2020, no example of a perfect cuboid had been found and no one has proven that none exist. [5]

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

Exhaustive computer searches show that, if a perfect cuboid exists,

Some facts are known about properties that must be satisfied by a primitive perfect cuboid, if one exists, based on modular arithmetic: [8]

In addition:

If a perfect cuboid exists and are its edges, — the corresponding face diagonals and the space diagonal , then

Cuboid conjectures

Three cuboid conjectures are three mathematical propositions claiming irreducibility of three univariate polynomials with integer coefficients depending on several integer parameters. The conjectures are related to the perfect cuboid problem. [12] [13] Though they are not equivalent to the perfect cuboid problem, if all of these three conjectures are valid, then no perfect cuboids exist. They are neither proved nor disproved.

Cuboid conjecture 1.For any two positive coprime integer numbers the eighth degree polynomial

is irreducible over the ring of integers .

Cuboid conjecture 2.For any two positive coprime integer numbers the tenth-degree polynomial

is irreducible over the ring of integers .

Cuboid conjecture 3.For any three positive coprime integer numbers , , such that none of the conditions

are fulfilled, the twelfth-degree polynomial

is irreducible over the ring of integers .

Almost-perfect cuboids

An almost-perfect cuboid has 6 out of the 7 lengths as rational. Such cuboids can be sorted into three types, called body, edge, and face cuboids. [14] In the case of the body cuboid, the body (space) diagonal g is irrational. For the edge cuboid, one of the edges a, b, c is irrational. The face cuboid has one of the face diagonals d, e, f irrational.

The body cuboid is commonly referred to as the Euler cuboid in honor of Leonhard Euler, who discussed this type of cuboid. [15] He was also aware of face cuboids, and provided the (104, 153, 672) example. [16] The three integer cuboid edge lengths and three integer diagonal lengths of a face cuboid can also be interpreted as the edge lengths of a Heronian tetrahedron that is also a Schläfli orthoscheme. There are infinitely many face cuboids, and infinitely many Heronian orthoschemes. [17]

The smallest solutions for each type of almost-perfect cuboids, given as edges, face diagonals and the space diagonal (a, b, c, d, e, f, g), are as follows:

As of July 2020, there are 167,043 found cuboids with the smallest integer edge less than 200,000,000,027: 61,042 are Euler (body) cuboids, 16,612 are edge cuboids with a complex number edge length, 32,286 were edge cuboids, and 57,103 were face cuboids. [18]

As of December 2017, an exhaustive search counted all edge and face cuboids with the smallest integer space diagonal less than 1,125,899,906,842,624: 194,652 were edge cuboids, 350,778 were face cuboids. [7]

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

Connection to elliptic curves

In 2022, Aubrey de Grey published [20] an exploration of perfect isosceles rectangular frusta, which he termed "plinths". These are hexahedra with two rectangular faces of the same aspect ratio and four faces that are isosceles trapezia. Thus, as for almost-perfect cuboids and perfect parallelepipeds, a perfect cuboid would be a special case of a perfect plinth. Perfect plinths exist, but are much rarer for a given size than perfect parallelepipeds or almost-perfect cuboids. In a subsequent paper, [21] de Grey, Philip Gibbs and Louie Helm built on this finding to explore classes of elliptic curve that correspond to perfect plinths, almost-perfect cuboids, and other generalisations of perfect cuboids. By this means they dramatically increased the range up to which perfect cuboids can be sought computationally, and thereby derived strong circumstantial evidence that none exists. They also showed that a large proportion of Pythagorean triples cannot form a face of a perfect cuboid, by identifying several families of elliptic curves that must have positive rank if a perfect cuboid exists. Independently, Paulsen and West showed [22] that a perfect cuboid must correspond to a congruent number elliptic curve of rank at least 2.

See also

Notes

  1. 1 2 3 4 5 Wacław Sierpiński, Pythagorean Triangles , Dover Publications, 2003 (orig. ed. 1962).
  2. Visions of Infinity: The Great Mathematical Problems By Ian Stewart, Chapter 17
  3. Weisstein, Eric W. "Euler Brick". MathWorld .
  4. Knill, Oliver (February 24, 2009). "Treasure Hunting Perfect Euler bricks" (PDF). Math table. Harvard University.
  5. Ivanov, A. A.; Skopin, A. V. (March 2020). "On sets with integer n-distances". Journal of Mathematical Sciences. 251 (4): 548–556. doi:10.1007/s10958-020-05159-4 . Retrieved October 11, 2024.
  6. 1 2 Matson, Robert D. (January 18, 2015). "Results of a Computer Search for a Perfect Cuboid" (PDF). unsolvedproblems.org. Retrieved February 24, 2020.
  7. 1 2 Alexander Belogourov, Distributed search for a perfect cuboid, https://www.academia.edu/39920706/Distributed_search_for_a_perfect_cuboid
  8. M. Kraitchik, On certain Rational Cuboids, Scripta Mathematica, volume 11 (1945).
  9. 1 2 I. Korec, Lower bounds for Perfect Rational Cuboids, Math. Slovaca, 42 (1992), No. 5, p. 565-582.
  10. Ronald van Luijk, On Perfect Cuboids, June 2000
  11. Florian Luca (2000) "Perfect Cuboids and Perfect Square Triangles", Mathematics Magazine, 73:5, p. 400-401
  12. Sharipov R.A. (2012). "Perfect cuboids and irreducible polynomials". Ufa Math Journal. 4 (1): 153–160. arXiv: 1108.5348 . Bibcode:2011arXiv1108.5348S.
  13. Sharipov R.A. (2015). "Asymptotic approach to the perfect cuboid problem". Ufa Math Journal. 7 (3): 100–113. doi: 10.13108/2015-7-3-95 .
  14. Rathbun R. L., Granlund Т., The integer cuboid table with body, edge, and face type of solutions // Math. Comp., 1994, Vol. 62, P. 441-442.
  15. Euler, Leonhard, Vollst¨andige Anleitung zur Algebra, Kayserliche Akademie der Wissenschaften, St. Petersburg, 1771
  16. Euler, Leonhard, Vollst¨andige Anleitung zur Algebra, 2, Part II, 236, English translation: Euler, Elements of Algebra, Springer-Verlag 1984
  17. "Problem 930" (PDF), Solutions, Crux Mathematicorum, 11 (5): 162–166, May 1985
  18. Rathbun, Randall L. (14 Jul 2020). "The Integer Cuboid Table". arXiv: 1705.05929v4 [math.NT].
  19. Sawyer, Jorge F.; Reiter, Clifford A. (2011). "Perfect parallelepipeds exist". Mathematics of Computation . 80 (274): 1037–1040. arXiv: 0907.0220 . doi:10.1090/s0025-5718-2010-02400-7. S2CID   206288198..
  20. de Grey, Aubrey D.N.J. (2022). "Perfect plinths: a path to resolving the perfect cuboid question?". Geombinatorics . 31: 156–161.
  21. de Grey, Aubrey D.N.J.; Gibbs, Philip; Helm, Louie (2024). "Novel required properties of, and efficient algorithms to seek, perfect cuboids". Geombinatorics . 33: 107–131.
  22. Paulsen, William; West, Graham (2022). "On perfect cuboids and CN-elliptic curves". Houston Journal of Mathematics . 48: 227–240.

Related Research Articles

<span class="mw-page-title-main">Diophantine equation</span> Polynomial equation whose integer solutions are sought

In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, for which only integer solutions are of interest. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponential Diophantine equation is one in which unknowns can appear in exponents.

In mathematics, a finite field or Galois field is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are the integers mod p when p is a prime number.

<span class="mw-page-title-main">Isomorphism</span> Inversible mapping (mathematics)

In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is derived from Ancient Greek ἴσος (isos) 'equal' and μορφή (morphe) 'form, shape'.

<span class="mw-page-title-main">Modular arithmetic</span> Computation modulo a fixed integer

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.

<span class="mw-page-title-main">Number theory</span> Mathematics of integer properties

Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics." Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers, or defined as generalizations of the integers.

<span class="mw-page-title-main">Parallelepiped</span> Hexahedron with parallelogram faces

In geometry, a parallelepiped is a three-dimensional figure formed by six parallelograms. By analogy, it relates to a parallelogram just as a cube relates to a square.

<span class="mw-page-title-main">Pythagorean triple</span> Integer side lengths of a right triangle

A Pythagorean triple consists of three positive integers a, b, and c, such that a2 + b2 = c2. Such a triple is commonly written (a, b, c), a well-known example is (3, 4, 5). If (a, b, c) is a Pythagorean triple, then so is (ka, kb, kc) for any positive integer k. A triangle whose side lengths are a Pythagorean triple is a right triangle and called a Pythagorean triangle.

In geometry, a tetrahedron, also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertices. The tetrahedron is the simplest of all the ordinary convex polyhedra.

<span class="mw-page-title-main">Ulam spiral</span> Visualization of the prime numbers formed by arranging the integers into a spiral

The Ulam spiral or prime spiral is a graphical depiction of the set of prime numbers, devised by mathematician Stanisław Ulam in 1963 and popularized in Martin Gardner's Mathematical Games column in Scientific American a short time later. It is constructed by writing the positive integers in a square spiral and specially marking the prime numbers.

A Heronian tetrahedron is a tetrahedron whose edge lengths, face areas and volume are all integers. The faces must therefore all be Heronian triangles . Every Heronian tetrahedron can be arranged in Euclidean space so that its vertex coordinates are also integers.

<span class="mw-page-title-main">Cube (algebra)</span> Number raised to the third power

In arithmetic and algebra, the cube of a number n is its third power, that is, the result of multiplying three instances of n together. The cube of a number or any other mathematical expression is denoted by a superscript 3, for example 23 = 8 or (x + 1)3.

In geometry, a Heronian triangle is a triangle whose side lengths a, b, and c and area A are all positive integers. Heronian triangles are named after Heron of Alexandria, based on their relation to Heron's formula which Heron demonstrated with the example triangle of sides 13, 14, 15 and area 84.

<span class="mw-page-title-main">Space diagonal</span>

In geometry, a space diagonal of a polyhedron is a line connecting two vertices that are not on the same face. Space diagonals contrast with face diagonals, which connect vertices on the same face as each other.

<span class="mw-page-title-main">Pythagorean quadruple</span> Four integers where the sum of the squares of three equals the square of the fourth

A Pythagorean quadruple is a tuple of integers a, b, c, and d, such that a2 + b2 + c2 = d2. They are solutions of a Diophantine equation and often only positive integer values are considered. However, to provide a more complete geometric interpretation, the integer values can be allowed to be negative and zero (thus allowing Pythagorean triples to be included) with the only condition being that d > 0. In this setting, a Pythagorean quadruple (a, b, c, d) defines a cuboid with integer side lengths |a|, |b|, and |c|, whose space diagonal has integer length d; with this interpretation, Pythagorean quadruples are thus also called Pythagorean boxes. In this article we will assume, unless otherwise stated, that the values of a Pythagorean quadruple are all positive integers.

<span class="mw-page-title-main">Irrational number</span> Number that is not a ratio of integers

In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being incommensurable, meaning that they share no "measure" in common, that is, there is no length, no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself.

<span class="mw-page-title-main">Integer triangle</span> Triangle with integer side lengths

An integer triangle or integral triangle is a triangle all of whose side lengths are integers. A rational triangle is one whose side lengths are rational numbers; any rational triangle can be rescaled by the lowest common denominator of the sides to obtain a similar integer triangle, so there is a close relationship between integer triangles and rational triangles.

<span class="mw-page-title-main">Fermat's right triangle theorem</span> Rational right triangles cannot have square area

Fermat's right triangle theorem is a non-existence proof in number theory, published in 1670 among the works of Pierre de Fermat, soon after his death. It is the only complete proof given by Fermat. It has many equivalent formulations, one of which was stated in 1225 by Fibonacci. In its geometric forms, it states:

<span class="mw-page-title-main">Trirectangular tetrahedron</span> Tetrahedron where all three face angles at one vertex are right angles

In geometry, a trirectangular tetrahedron is a tetrahedron where all three face angles at one vertex are right angles. That vertex is called the right angle or apex of the trirectangular tetrahedron and the face opposite it is called the base. The three edges that meet at the right angle are called the legs and the perpendicular from the right angle to the base is called the altitude of the tetrahedron.

<span class="mw-page-title-main">Rectangular cuboid</span> Cuboid with all right angles and equal opposite faces

A rectangular cuboid is a special case of a cuboid with rectangular faces in which all of its dihedral angles are right angles. This shape is also called rectangular parallelepiped or orthogonal parallelepiped.

<span class="mw-page-title-main">Sixth power</span> Result of multiplying six instances of a number

In arithmetic and algebra the sixth power of a number n is the result of multiplying six instances of n together. So:

References