0021: Article 11 (Euler Bricks and Quadruples)
Back to Index Go to Updates Page
Euler Bricks and Euler Quadruples
by Tito Piezas III
I. Euler Brick
II. Generalized Euler Brick
III. Euler Quadruples
IV. Formulas for Quadruples
V. A General Method
I. Euler Brick
In 1740, a noted blind mathematician by the name of Nicholas Saunderson found a simple parametrization to what is now called a Euler brick. (Author’s note: Saunderson, the 4th Lucasian professor of mathematics – Newton being the 2nd – was blind from infancy.) A Euler brick is defined by a triple of positive integers {a,b,c} such that,
{a2+b2, a2+c2, b2+c2}
are all squares, the smallest being {a,b,c} = {44, 117, 240}. Saunderson’s solution (rediscovered by Euler and others) was, given x2+y2 = z2, define,
{a,b,c} = {x(x2-3y2), y(3x2-y2), 4xyz} [1]
then,
a2+b2 = (z3)2
a2+c2 = x2(x2+5y2)2
b2+c2 = y2(5x2+y2)2
with the first sum as a 6th power. Since {x,y,z} is the Pythagorean triple {p2-q2, 2pq, p2+q2}, then {a,b,c} are 6th degree polynomials in {p,q}. For a particular example, let {x,y,z} = {3, 4, 5} and this yields the smallest numerical example given above. If {a,b,c} is a Euler brick, then so is {ab, ac, bc}, call this Rule 1. Saunderson’s solution, then yields after removing common factors,
{a’,b’,c’} = {4xz(x2-3y2), 4yz(3x2-y2), (x2-3y2)(3x2-y2)} [2]
which would be 8th deg polynomials in {p,q}. No other 6th deg (or smaller) solutions are known, but there are others of 8th deg. The four smallest Euler bricks are,
{44, 117, 240}
{85, 132, 720}
{88, 234, 480}
{132, 351, 720}
Curiously, the second and fourth bricks share two terms. There are an infinite number of such Euler brick pairs. Let u2+v2 = 5w2, then,
W. Lenhart: {a,b,c} = {(u2-w2)(v2-w2), 4uvw2, 2uw(v2-w2)} [3]
Piezas: {a,b,c} = {(u2-w2)(v2-w2), 4uvw2, 2vw(u2-w2)} [4]
(Notice the variables u and v just swap places.) For this pair, one member can be derived from the other using Rule 1 and removing common factors. This curious phenomenon of shared terms can also be found in face cuboids (explainable by three related identities discussed in the previous article), Euler quadruples (by a change of sign in a single identity), and in generalized Euler bricks though for the last case, no identities have yet been found that explains the shared terms.
However, it can be proven that there are an infinite number of identities of the kind [1]-[4].
A. Euler’s method
Let {a,b,c} = {(p2-1)/(2p), (q2-1)/(2q), 1}.
This makes a2+c2, b2+c2 as squares. To make a2+b2 a square as well, find {p,q} such that,
p2(q2-1)2 + q2(p2-1)2 = t2
This can be treated as an elliptic curve hence, from an initial rational point, one can compute an infinite number of other rational points. Define the conditional equation Q as x2+y2 = z2, then,
{p,q} = { 2y/z, z/(2x) }
{p,q} = { 2y/z, y(2x+z)/((x+z)(2x-z)) }
and so on. After simplifying, these two yield identities [1] and [2], respectively.
B. Lenhart’s method
Let {a,b,c} = {(p2-1)/(2p), 2q/(q2-1), 1}.
Notice this is a very similar transformation to Euler. Likewise, two of the diagonals become squares, but to make a2+b2 a square as well, solve,
(p2-1)2(q2-1)2 + 16p2q2 = t2
Again, this can be treated as an elliptic curve. Define a different conditional equation Q as u2+v2 = 5z2, then,
{p,q} = { uv/(2w2), (v+w)/(v-w)}
{p,q} = { uv/(2w2), (v2-4w2)(v2+w2)/((v2-w2)(v2-6w2)) }
and so on. The first point yields identity [3].
It seems to be unknown if there are other conditional quadratics Q that can be used in Euler’s or Lenhart’s method. (Note: Ultimately, however, a quadratic solution to any Q can be expressed in terms of Pythagorean triples {x,y,z}. For example, it is the case that (x+2y)2 + (2x-y)2 = 5z2, though the resulting expressions for Identity 3 in {x,y,z} are messier compared to the ones in {u,v,w}.) In Andrew Bremner’s 1988 paper, The rational cuboid and a quartic surface, he gives a general method for finding Euler brick parametrizations and points out evidence suggest these may be found for every even deg ≥ 6 (though are not necessarily expressible by some conditional quadratic Q) .
C. Leudesdorf showed that a Euler brick {a,b,c} is equivalent to finding three positive rationals {u,v,w} such that,
2(u2+v2-w2) = a2 (eq.1)
2(u2-v2+w2) = b2 (eq.2)
2(-u2+v2+w2) = c2 (eq.3)
Proof: Solving for {u,v,w}, we get,
a2+b2 = (2u)2
a2+c2 = (2v)2
b2+c2 = (2w)2
which defines a Euler brick. The smallest example would yield {u,v,w} = { 125/2, 122, 267/2}. (End proof).
Adding eqns 1,2,3 together, a perfect Euler brick must then have a space diagonal d whose square is both the sum of three squares and double the sum of another three squares,
a2+b2+c2 = 2(u2+v2+w2) = d2 (eq.4)
By itself, eq.4 is easily solved, the smallest in distinct and positive integers is,
{a,b,c,d} = {4, 6, 12, 14}
{u,v,w} = {3, 5, 8}
though solving eq.1-4 simultaneously is another matter.
II. Generalized Euler Brick
Similar to Leudesdorf’s, Euler also considered the system,
u2+v2-w2 = a2
u2-v2+w2 = b2
-u2+v2+w2 = c2
Solving for {u,v,w}, the problem is equivalent to finding generalized Euler bricks {a,b,c} for the case n = 2 of,
a2+b2 = nu2 (eq.1)
a2+c2 = nv2 (eq.2)
b2+c2 = nw2 (eq.3)
call this system Sn. Jarek Wroblewski pointed out that Sn has non-trivial solutions in the integers only for n = {1, 2}. Excluding the trivial a = b = c, the smallest for S2 is {a,b,c} = {1,1,7}. Solutions with a = b can be parameterized as,
{a,b,c} = {p2-2q2, p2-2q2, p2+4pq+2q2}
for arbitrary {p,q} with the smallest being the case {p,q} = {1,1}. For distinct and primitive {a,b,c}, Wroblewski (2010) found for bound B < 6000, only seven, namely,
{329, 191, 89}
{527, 289, 23}
{833, 553, 97}
{1081, 833, 119}
{1127, 697, 17}
{4991, 2263, 287}
{5609, 4991, 1871}
The smallest was known to Euler as an instance of a parametric family that depended, perhaps not surprisingly, on the simple conditional equation, x2+y2 = 2z2 as,
{a,b,c} = {x(y2+4yz-4z2), x(y2-4yz-4z2), y(3y2-4z2)}
(This has been slightly modified by this author. One can also swap x and y since this does not affect the conditional eqn.) Let {x,y,z} = {1, 7, 5} and it yields the smallest with distinct {a,b,c}. Note also how some triples share a common term, a phenomenon also present with face cuboids and was explained by three identities that, two at a time, share a common term. However, I haven't yet found corresponding identities for these pairs of “Euler bricks” over √2. And whether,
a2+b2+c2 = nt2 (eq.4)
for n = 2 is solvable along with eq.1,2,3 is also unknown.
III. Euler Quadruple
A Euler quadruple, on the other hand, are four positive integers {a,b,c,d} such that,
{a2+b2+c2, a2+c2+d2, a2+b2+d2, b2+c2+d2}
are all squares. The expression x2+y2+z2 can also be given a geometric interpretation as the space diagonal (given by the blue line) of a cuboid,
If the four cuboids are positioned so that one end of each diagonal all meet at an apex, then this defines an irregular pyramid with four triangular faces and a slanted quadrilateral base. (Interestingly, Euler would solve a quadruple in terms of one or two triangles.)
The smallest, found by Wroblewski (2010), is {a,b,c,d} = {49, 72, 72, 84} so,
a2+b2+c2 = 1132
a2+c2+d2 = 114
a2+b2+d2 = 114
b2+c2+d2 = 1322
He also gave all {a,b,c,d} < 1000 with gcd = 1 as,
{49, 72, 72, 84}
{21, 28, 120, 120}
{60, 105, 168, 280}
{313, 336, 336, 492}
{237, 336, 336, 952}
Apparently, Euler missed the smallest while the second and third were known to him as instances of two parametric families which uses Pythagorean triples. It is not known if the smallest belongs to a family. There are also an infinite number of quadruple pairs that share a common side as can be proven by an identity in the next section.
IV. Formulas for Quadruples
Just like face cuboids (discussed in the previous article, “Mengoli’s Six Square Problem and Face Cuboids”), there are interesting formulas for Euler quadruples by various authors that use any of the simple eqns,
1) x2+y2 = z2,
2) x2+3y2 = z2,
3) p4+q4 = r4+s4
though the formulas have been modified for a more aesthetic presentation.
1. x2+y2 = z2
Euler:
i) Define {a,b,c,d} = {2xyz, x(x2-y2), y(x2-y2), 2xyz}. Then,
a2+b2+c2 = z6
a2+c2+d2 = x2(x2+3y2)2
a2+b2+d2 = y2(3x2+y2)2
b2+c2+d2 = z6
Just like for Euler bricks, a sum is a 6th power. Another formula, derivable from a general method given by Euler in the next section is,
ii) Define {a,b,c,d} = {2pxyz, px(x2-y2), qy(x2-y2), 2qxyz}, where {p,q} = {x4-6x2y2-3y4, 3x4+6x2y2-y4}.
Notice the affinity between the two formulas (i) and (ii), with the first simply as the case p = q = 1. I am not aware of any other polynomial for {p,q}, though there may be. For {x,y,z}= {3, 4, 5}, this yields {a,b,c,d} = {120, 21, 28, 120} which is the second smallest solution, and {a,b,c,d} = {186120, 32571, 23828, 102120}, respectively.
2. x2+3y2 = z2
Euler, S. Tebay: Define {a,b,c,d} = {y(x2-y2), z(x2-y2), 2yz(x-y), 2yz(x+y)}. Then,
a2+b2+c2 = (xz2-4y3)2
a2+b2+d2 = (xz2+4y3)2
a2+c2+d2 = (3yz2-4y3)2
b2+c2+d2 = z6
The last sum again is a sixth power. Let {x,y,z} = {1, 4, 7} and this gives {a,b,c,d} = {60, 105, 168, 280}, which is the third smallest Euler quadruple.
3. p4+q4 = r4+s4
Piezas: Define {a,b,c,d} = {2pruv, 2qsuv, uw, 2pqrsw}, where {u,v,w} = {p4-r4, p2r2-q2s2, pr(q4+s4) ±qs(p4+r4)}, and p4+q4 = r4+s4.
This yields a pair of quadruples, {a,b,c1,d1} and {a,b,c2,d2}, with two common sides: a and b. (One can change the sign of q without affecting the conditional eqn.) The sums are too tedious to be explicitly write down, but one can test it with any parametric solution, or particular ones like {p,q,r,s} = {59, ±158, 133, 134}, though {a,b,c,d} typically will be large values.
V. A General Method
Theorem (Euler): Assume,
a2+b2+c2 = (bx3+dx2)2/x12
a2+c2+d2 = (bx2+dx3)2/x12
a2+b2+d2 = (ax3-cx1)2/x22
b2+c2+d2 = (ax1-cx3)2/x22
Given two Pythagorean triples {x1, x2, x3} and {y1, y2, y3}. If the product of the legs is a square x1x2y1y2 = m2, and set n = x2y1, then a quadruple is,
{a,b,c,d} = {1, m/n, d(mx2)/(nx1), (mx3y1+nx1y3)/(nx1y2-nx2y1)}
Proof: One can substitute n = x2y1, {x1, x2, x3} = {e2-f2, 2ef, e2+f2}, and {y1, y2, y3} = {g2-h2, 2gh, g2+h2}, and the four eqns are true if,
x1x2y1y2 = m2
or, equivalently,
4efgh(e2-f2)(g2-h2) = m2 (eq.1)
(End proof)
Example: Eq.1 is also discussed in “Mengoli’s Six Square Problem and Face Cuboids”. However, there are many small solutions, one of which is {e,f,g,h} = {5, 2, 6, 1} yielding,
{x1, x2, x3} = {21, 20, 29}
{y1, y2, y3} = {35, 12, 37}
{m,n} = {420, 735}
After scaling, this gives {a,b,c,d} = {105, 60, 168, 280} which is the third smallest Euler quadruple. For a parametrization, let x2+y2 = z2:
i) If {x1,x2,x3} = {y,x,z}; {y1,y2,y3} = {x,y,z}; hence x1x2y1y2 = (xy)2, then,
{a,b,c,d} = {2xyz, x(x2-y2), y(x2-y2), 2xyz}.
ii) If {x1,x2,x3} = {y,x,z}; {y1,y2,y3} = {z4-4x2y2, 4xyz2, z4+4x2y2}; hence x1x2y1y2 = (2xyz(x2-y2))2, then,
{a,b,c,d} = {2pxyz, px(x2-y2), qy(x2-y2), 2qxyz}, where {p,q} = {x4-6x2y2-3y4, 3x4+6x2y2-y4}.
Both were given in the previous section.
Any other simple formulas for generalized Euler bricks and Euler quadruples?
-- END --
© Dec 2010
Tito Piezas III
You can email author at tpiezas@gmail.com