Embedded Files
II. Sum / Sums of three squares
x2+y2+z2 = tk
x2+y2+z2 = u2+v2
(x2-1)(y2-1) = (z2-1)2
x2+y2+z2 = u2+v2+w2
x2+y2+z2 = (u2+v2+w2)Poly(t)
x2+y2+z2 = 3xyz
1. Form: x2+y2+z2 = tk
Geometrically, the case k = 2 of Form 1 can be seen as a cuboid with sides {x,y,z} and space diagonal t,
or, for t = r = 1, a sphere of unit radius,
Mehmed Nadir (also known as Mehmet Nadir)
a2(a2+b2)2 + (2ab2)2 + (a2-b2)2b2 = (a2+b2)3
Matsunago:
(a4-b4)2 + (4a2b2)2 + (2ab(a2-b2))2 = (a2+b2)4
Q: Is there one for k = 5? (See update below.) While we already know that (a2+b2)k is expressible as the sum of two squares, for what k is it identically the sum of three non-zero squares? By solving a2+b2 = (p2+q2)m, one can see there are solns when k = 3m, 4m for all integer m > 0. Letting d = b2, we can also express these as,
a2(a2+d)2 + (2ad)2 + (a2-d)2d = (a2+d)3
(a4-d2)2 + (4a2d)2 + (2a(a2-d))2d = (a2+d)4
where d can then be set as the sum of n squares d = x22+x32+…+xn2 thus proving, “ ...The kth power of the sum of n squares is the sum of n+1 squares for k = 3m or 4m.” But for what other k is there? One limited form with b = 1, is
A. Gerardin
(y-1)2 + y2 + (y+1)2 = x2 + 1, if x2-3y2 = 1
Thus the kth power of (x2+1)k, for all solns x to x2-3y2 = 1, should be expressible as the sum of three squares for any positive integer k. For ex, substituting {p,q,r} = {y-1, y, y+1} into the general identity, then for k = 2 this is,
(y2+4y)2 + (2y2-2y)2 +(2y2-2)2 = (x2+1)2, if x2-3y2 = 1
and so on for all k. A closer one is,
(a-2b)2 + (2a-b)2 + (2a+2b)2 = 9(a2+b2)
though this does not give Mehmed-Nadir’s or Matsunago’s elegant forms.
Update (6/18/09, 10/12/09) Theorem: "For all k > 2, the expression (a2+b2)k is the sum of three squares as polynomials in {a,b} with integral coefficients." Proof: Given the tautology,
a2+b2 = a2+b2
Multiply both sides by (a2+b2)2n,
(a2+b2) (a2+b2)2n = (a2+b2)2n+1
Distribute,
a2(a2+b2)2n + b2(a2+b2)2n = (a2+b2)2n+1
and it is easy to express either of the squares on the LHS as the sum of two squares. And since the eqn x12+x22+… +xn2 = (y12+y22+… +yn2)m can be solved for any positive integer m (Theorem 1 discussed at the start of this Section), then one can also solve,
a2(a2+b2)2n + b2(a2+b2)2n = (p2+q2)(2n+1)m
where {a,b} are polynomials in {p,q}. Together with the identity for k = 4, which is effectively for all k = 4m, then it is possible to express (a2+b2)k as the sum of three squares for all k > 2. (End proof.) For k = 5, this gives,
a2(a2+b2)4 + (4a3b2-4ab4)2 + (a4b-6a2b3+b5)2 = (a2+b2)5
One can then always find expressions {a,b} such that the sum is (p2+q2)5m. And so on for other prime k > 2. However, more generally,
Theorem 2: “For all n > 1 and k > 2, then x12+x22+… +xn+12 = (y12+y22+… +yn2)k, or the kth power of the sum of n squares is identically the sum of n+1 squares.”
Proof: As before, one simply expresses b2 = d, set d as any non-zero number of squares, distribute the third term appropriately, then use Theorem 1. For example, for k = 5, this is,
a2(a2+d)4 + (4a3d-4ad2)2 + (a4-6a2d+d2)2d = (a2+d)5
After setting, say, d = b2+c2,
a2(a2+b2+c2)4 + (4a3(b2+c2)-4a(b2+c2)2)2 + b2(a4-6a2(b2+c2)+(b2+c2)2)2 + c2(a4-6a2(b2+c2)+(b2+c2)2)2 = (a2+b2+c2)5
or 4 squares equal to the 5th power of 3 squares, one can then use Theorem 1 to find {a,b,c} such a2+b2+c2 = (p2+q2+r2)m, for any m. For m = 2, this would be {a,b,c} = {p2-q2-r2, 2pq, 2pr}. And so on for any n > 1 and k > 2. (End update.)
For (a2+b2)k as the sum of four squares, Barisien gave several examples for small k. These are easy to find since solns to u2+v2 = zm and x2+y2 = zn immediately imply,
(u2+v2)(x2+y2) = (ux)2+(vx)2+(uy)2+(vy)2 = zm+n.
E. Barisien:
a2(a2-b2-c2)2 + b2(a2+b2-3c2)2 + c2(a2-3b2+c2)2 + (2a2b)2 + (2a2c)2 + (4abc)2 = (a2+b2+c2)3
Q: How about the kth power of three squares (a2+b2+c2)k identically the sum of n squares with n > 4? Any other prime k?
F. Hrodmadko
n2 + (n+1)2 + (nx)2 = (nx+1)2, if x = n+1.
There is a similar identity for third powers, by Jandacek,
n3 + (x-n-1)3 + (nx)3 = (nx+1)3, if x = 3n2+3n+2.
Proving that any integer n appears at least once as a soln to ak+bk+ck = (c+1)k for k = 2 or 3. Finally, the system of eqns,
x1k+x2k+…+ xnk = y1k+y2k+…+ ynk, for k = 1,2
by Bastien’s theorem (to be discussed more in the section on Equal Sums of Like Powers) has non-trivial solns only for n > 2. It is possible two terms on one side are equal to zero and hence reduces to the minimal form,
ak+bk+ck = dk,
the complete soln of which obeys the relationship ab+ac+bc = 0 and is given by,
(p2+pq)k + (pq+q2)k + (-pq)k = (p2+pq+q2)k, for k = 1,2
implying at least one term is always negative. There are analogous cases for multi-grade third, fourth, fifth powers to be given later.
2. Form: x2+y2+z2 = u2+v2
One can set any of its terms equal to 1, but depending on which side of the equation it is chosen, it may need slightly different Pell equations. To set this form either as p2+q2+1 = s2+t2, or p2+q2+r2 = s2+1, can involve,
x2-(d+1)y2 = ±1; or x2-(d2+1)y2 = ±1
respectively. To find the complete soln of this form, use the more general one for x12+x22+x32 = y12+y22+y32,
(a-b)2 + (c+d)2 + (e-f)2 = (a+b)2 + (c-d)2 + (e+f)2
where ab-cd+ef = 0. It is easy to make one of the terms vanish.
(a-b)2 + (c+d)2 + 4n = (a+b)2 + (c-d)2
where n = ab-cd. Let {a,b,c} = {x+y, x-y, y2} and this condition becomes,
x2-(d+1)y2 = n
where one can then set n = ±1. If d,x,y are odd, then all the terms above are even and can be reduced. Alternative versions are,
Catalan (complete)
Catalan (complete)
(ad+qr)2 + (bd-pr)2 + w2 = (a+bd-pr)2 + (ad-b+qr)2, where r = (a2+b2-w2)/2, ap+bq = 1.
If we set p = q = 0, this reduces to,
(ad)2 + (bd)2 + w2 = (a+bd)2 + (ad-b)2, if a2+b2 = w2
or, explicitly,
(u2+v2)2 + (2duv)2 + (du2-dv2)2 = (du2-2uv-dv2)2 + (u2+2duv-v2)2
Integral solns to p2+q2+r2 = s2+1 can then be obtained by setting the last term u2+2duv-v2 = ±1. Let {u,v} = {x-dy, y} and this transforms into the Pell equation x2-(d2+1)y2 = ±1. Other solns are,
E.Fauquembergue:
(a+1)2 + (2a)2 + 1 = (2a+1)2 + (a-1)2
(2a2-b2+1)2 + (2ab)2 + 1 = (2a2+1)2 + (b2-1)2
Piezas
(a2-c2+a+1)2 + (2c)2 + 1 = (a2-c2+a-1)2 + (2a+1)2
(a2+c2+a-1)2 + (2c)2 + (2a+1)2 = (a2+c2+a+1)2 + 1
which were derived using the complete soln of x12+x22+x32 = y12+y22+y32. For the special case c = 0, these two become the same non-trivial identity,
(a2+a-1)2 + (2a+1)2 = (a2+a+1)2 + 1
while Fauquebergue’s for either {a,b} = 0 reduces to a tautology. The ff has been discussed previously,
A. Gerardin
(y-1)2 + y2 + (y+1)2 = x2 + 1, if x2-3y2 = 1.
Q: Does this generalize to an identity needing Pell equations distinct from the one derived from Catalan’s?
E. Lucas
(4m)2 + (8m+1)2 + (8m+2)2 = (12m+2)2 + 1
3. Form: (x2-1)(y2-1) = (z2-1)2
This eqn was studied by Schinzel and Sierpinski. Expanded out, this is just a special case of the previous form being,
x2 + y2 + (z2-1)2 = x2y2 +1
This has an infinite number of integral solns. A pair is given by,
{x,y} = {z+t, z-t}, if t2-2z2 = 2. (Smallest soln is {t,z} = {10,7}.)
{x,y} = {z+2t, z-2t}, if z2-2t2 = -1
Q: Any others? As with Gerardin’s and others, this can also be solved as x2 + y2 + (z2-1)2 = (x2y2 +1)k for any k > 0.
4. Form: x2+y2+z2 = u2+v2+w2
This form is important since certain equal sums of like powers for k = 4,5,6 may have this as a “side” condition. The complete soln already has been given earlier,
(a+b)2 + (c+d)2 + (e+f)2 = (a-b)2 + (c-d)2 + (e-f)2
where ab+cd+ef = 0. It is easy to give other conditions such that one of the terms vanish or has special forms like equal to unity, etc. The complete soln for k = 1,2 is,
L. Dickson
(ad+e)k + (bc+e)k + (ac+bd+e)k = (ac+e)k + (bd+e)k + (ad+bc+e)k, for k = 1,2
Note: This can be true for k = 4 as well if (a+b)(c+d) = -3e.
(Update, 12/29/09): Alain Verghote
Define {p,q} = {x2+2y2, 2x+xy2}, then,
p2 = (x2)2 + (2xy)2 + (2y2)2
q2 = (2x)2 + (2xy)2 + (xy2)2
Since there is a common middle term, then,
(2x)2 + (xy2)2 + (x2+2y2)2 = (2x+xy2)2 + (x2)2 + (2y2)2
This belongs to the general form,
ak + bk + (c+d)k = (a+b)k + ck + dk,
which is already for k = 1, and will also be true for k = 2 if ab-cd. (End update.)
C. Goldbach
p2 + q2 + (p+q+3r)2 = (p+2r)2 + (q+2r)2 + (p+q+r)2
Note: Can be simultaneous for k = 2,3 if 6(pq+pr+qr)+5r2 = 0. Alternatively, this can be more simply expressed as,
(p-r)k + (q-r)k + (p+q+r)k = (p+r)k + (q+r)k + (p+q-r)k
which is already for k = 2, but is also valid for k = 3 if 6pq = r2.
Euler:
a2 + b2 + c2 = (a+2d)2 + (b+2d)2 + (c+2d)2, if a+b+c+3d = 0.
In general,
a2 + b2 + c2 = (a+pm)2 + (b+qm)2 + (c+rm)2, if m = -2(ap+bq+cr)/(p2+q2+r2)
R. Davis
a2+b2+c2 = (ap+bq+cr)2 + (aq+br+cp)2 + (ar+bp+cq)2, if p+q+r =1 and 1/p+1/q+1/r = 0.
Q: This seems a particularly elegant soln. In what context does it appear?
L. Lander
x12+x22+x32 = y12+y22+y32
{x1, x2, x3} = {b(ac+d), (a-c)(ac-d), ab(a+c)}
{y1, y2, y3} = {b(ac-d), (a+c)(ac+d), ab(a-c)}
where d = b2-c2. Any soln that also satisfies x1x2x3 = y1y2y3 (which is the case for this example) can then generate solns to,
z1k+z2k+z3k+z4k = z5k+z6k+z7k+z8k, for k = 1,3,5
A. Choudhry
(ay+b)2 + (cy+ad)2 + (-ay+b+cd)2 = (ay-b)2 + (cy-ad)2 + (-ay-b-cd)2
for any variable. For certain values a,b,c,d,y, which require solving a particular elliptic curve, this also becomes true for k = 2,3,4.
A. Choudhry
x1k+x2k+x3k = y1k+y2k+y3k
{x1, x2, x3} = {-2am+(b+c)n, (a+b)m+(a+c)n, (a-b)m-(a-c)n}
{y1, y2, y3} = { 2am+(b+c)n, -(a+b)m+(a+c)n, -(a-b)m-(a-c)n}
for k = 1,2. This can be extended for k = 6, but a quartic polynomial in c must be made a square as will be discussed in the section on Sixth Powers.
Q: Any other soln for k=2 that can be used for k=6?
5. Form: x2+y2+z2 = (u2+v2+w2)Poly(t)
H. Burhenne
x12+x22+x32 = (p2+q2+r2)(x2+y2+z2)2
{x1, x2, x3} = {ps-2tx, qs-2ty, rs-2tz}, where {s,t} = {x2+y2+z2, px+qy+rz}
for arbitrary p,q,r and x,y,z. One can also set {p,q,r} = {y,z,x} to solve x12+x22+x32 = (x2+y2+z2)3. This was generalized as,
S. Realis
ax12+bx22+cx32 = (ap2+bq2+cr2)(ax2+by2+cz2)2
{x1, x2, x3} = {ps-2tx, qs-2ty, rs-2tz} where {s,t} = {ax2+by2+cz2, apx+bqy+crz}
where Burhenne’s is simply the case a=b=c=1. (This can be generalized to n addends as discussed in Section 003.) The next one is also essentially the same.
G. Malfatti
p2+q2+r2 = (a2+b2+c2)(d2+e2+f2)2
{p,q,r} = {(d2+e2-f2)a+2bdf+2cef, (-d2+e2+f2)b+2adf-2cde, (d2-e2+f2)c+2aef-2bde}
H. Mathieu
x2+y2+z2 = (a2+b2+c2)(c2m2+c2n2+(am+bn)2)
{x,y,z} = {abm+(b2+c2)n, abn+(a2+c2)m, acn-bcm}
6. Form: x2+y2+z2 = 3xyz
Known as the Markov equation, Frobenius proved that x2+y2+z2 = nxyz has positive integer solns only for n=1,3 with the former reducible to the latter by scaling variables. Markov gave various parametrizations (?) to this equation though this author hasn’t been able to find them yet. (The similar equation x3+y3+z3 = 3xyz will be discussed later in the section on third powers.) Define {x,y,z} as a Markov triple, with the first few ones as {1,1,1}, {2,1,1}, {5,1,2}, {13,1,5}, etc. It can be shown that one soln leads to another,
Theorem: “If x2+y2+z2 = 3xyz, then x2+y2+(3xy-z)2 = 3xy(3xy-z)."
More generally, if we let z = (3xy ± p)/2, it transforms to:
p2-(9x2-4)y2 = -4x2 (eq.1)
which is a Pell-like eqn. This approach is essentially solving the Markov equation as a quadratic in z and making its discriminant a square. The problem now is to find an x such that this has a soln {p,y}. If for a particular x there is one, then there is in fact an infinity. For the particular case x = 1, let {x,y,z} = {1, y, (3y ± p)/2}, then eq.1 is,
p2 -5y2 = -4
which guarantees a bisection (every other term) of the Fibonacci numbers, namely y1 = {1, 2, 5, 13, etc.}, will appear in a Markov triple,. Since {p,y} are either both odd or even, then z will always be an integer. For x = 2, let {x,y,z} = {2, y, (3y ± 2r)}, then eq.1 is,
r2 -2y2 = -1
and a bisection of the Pell numbers as y2 = {1, 5, 29, 169, etc} will also be in a triple. So what other x are there? There are x that are neither Fibonacci nor Pell, the smallest of which are x = 194, 433, 1325, etc. Since the Markov eqn is symmetric and the terms {x,y,z} can be interchanged, the elements of the bisections naturally can also be used as an x. For example, if we use x = 5, eq.1 is,
p2-221y2 = -100
This has three fundamental y, namely y = {1, 2, 13} but a non-fundamental one is y = 194 which explains this smallest non-Fibonacci, non-Pell, Markov number and others. In turn, we can then use this y as an x. In general, if a number appears in a Markov triple, then it will appear in an infinite number of triples. Q. Any parametric soln?
Just like one can solve the sum of two squares equal to a kth power in the form,
A2+B2 = (a2+b2)k
it can also be done for three squares,
A2+B2+C2 = (a2+b2+c2)k
for any positive integer k. In fact, it can be done for n squares and the general result is that:
Theorem 1: “For all n and k, then x12+x22+… +xn2 = (y12+y22+… +yn2)k, or the kth power of the sum of n squares is identically the sum of n squares.”
Theorem 2: “For all n > 1 and k > 2, then x12+x22+… +xn+12 = (y12+y22+… +yn2)k, or the kth power of the sum of n squares is identically the sum of n+1 squares.”
Note 1: The case k = 2 is discussed in Sums of n Squares.
Note 2: The cubic version A3+B3+C3-3ABC = (a3+b3+c3-3xyz)k is discussed as Form 21 in Cubic Polynomial as a kth Power.
Proof for Theorem 1: (Piezas) The proof is simple. Let the expansion of the complex number (a±bi)k be,
U+Vi = (a+bi)k; U-Vi = (a-bi)k
where U,V are expressions in the arbitrary a,b. It is easy to see their product, or norm, is,
U2+V2 = (a2+b2)k
Note that b can be factored out in V, or V = V1b, so if we let {a,b} = {p1,√p0}, then,
U2 + p0V12 = (p12+p0)k
And since p0 is arbitrary, one can choose it to be the sum of squares p0 = p22+p32+…+pn2 giving,
U2 + V12p22 + … + V12pn2 = (p12+ p22+…+pn2)k
Thus proving the kth power of n squares is itself the sum of n squares. (End proof.) For k = 2, this is,
(p12-p0)2 + p0(2p1)2 = (p12+p0)2
so if p0 = p22, this gives the classic formula for Pythagorean triples. But if p0 = p22+p32, and changing variables, yields an analogue for three squares,
(a2-b2-c2)2 + (2ab)2 + (2ac)2 = (a2+b2+c2)2
which, after scaling, is the complete soln. For k = 3,
(a3-3ab2-3ac2)2 + b2(-3a2+b2+c2)2 + c2(-3a2+b2+c2)2 = (a2+b2+c2)3
and so on for all positive integer k and n. (Using identities by Mehmed Nadir and Matsunago, we will see that the kth power of the sum of n squares is also identically the sum of n+1 squares for k = 3m or 4m. Update: It can be done for all k > 2. See further below.)
though this can be derived from Catalan's by letting c → c'/2.
J. Euler
((a2+c2)(b2-c2))2 + (2bc(a2-c2))2 + (4abc2)2 = ((a2+c2)(b2+c2))2
(2(a+b)c)2 + (2(a-b)c)2 + (2a2+2b2-c2)2 = (2a2+2b2+c2)2
(Update, 6/25/10): Alain Verghote gave a similar identity,
(2(a+b)c)2 + (a2-b2)2 + (2ab-2c2)2 = (a2+b2+2c2)2
(2(a+b)c)2 + (2(a-b)c)2 + (a2+b2-2c2)2 = (a2+b2+2c2)2
(a2-c2)2 + ((a+c)(b+c))2 + ((a+c)(b-c))2 + (2ac-b2-c2)2 = (a2+b2+2c2)2
By analogy to Pythagorean triples, the numbers {x,y,z,t} is also known as a Pythorean quadruple. The simplest integer soln is,
n2 + (n+1)2 + (n2+n)2 = (n2+n+1)2
which easily proves that every integer appears at least once in an integer Pythagorean quadruple. Similarly for quintuples,
n2 + (n-2)2 + (2n+1)2 + (3n2+2)2 = (3n2+3)2
and so on.
Theorem: The complete soln to x12+x22+x32 = y12 is given by,
((a2-b2-c2)t)2 + (2abt)2 + (2act)2 = ((a2+b2+c2)t)2
where t is just a scaling factor. Proof: For any soln xi one can always find rational {a,b,c,t} using the formulas: {a,b,c,t} = {x1+y1, x2, x3, 1/(2(x1+y1))}.
Similarly, Theorem: The complete non-trivial soln to x12+x22+x32+x42 = y12 is given by the scaled Euler-Aida Ammei identity,
((a2-b2-c2-d2)t)2 + (2abt)2 + (2act)2 + (2adt)2= ((a2+b2+c2+d2)t)2
Proof: For any soln xi one can always find rational {a,b,c,d,t} using the formulas: {a,b,c,d,t} = {x1+y1, x2, x3, x4, 1/(2(x1+y1))}.
and so on. One can easily see the pattern for other n sums of squares.
Update (10/11/09): The eqn x2+y2+z2 = 1, which also defines a sphere of unit radius centered at the origin, also appears in the eqn x2 = -1 where x, instead of the imaginary unit, is to be a quaternion. To recall, given the expansion of (a+bi+cj+dk)n = A+Bi+Cj+Dk, then,
A2+B2+C2+D2 = (a2+b2+c2+d2)n
In a Mathematica add-on package, this object is given as Quaternion[a,b,c,d] and one can use NonCommutativeMultiply to multiply them, and for the case n = 2, we get,
Quaternion[a,b,c,d] ** Quaternion[a,b,c,d] = Quaternion[a2-b2-c2-d2, 2ab, 2ac, 2ad] (eq.1)
One can note two immediate consequences. First, as expected, (a2-b2-c2-d2)2 + (2ab)2 + (2ac)2 + (2ad)2 = (a2+b2+c2+d2)2. Second, while the Fundamental Theorem of Algebra states that an nth degree univariate equation with complex coefficients has n complex roots, this does not apply when the roots are quaternions. For example, the nth roots of plus/minus unity or, xn = ±1 have n complex solns. But if x is to be a quaternion, then there can be an infinite number of them. Let n = 2 and take the negative case: x2 = -1. Thus, we wish (eq.1) to have the product: Quaternion[-1,0,0,0]. Since the {a,b,c,d} are to be real, then a = 0, and {b,c,d} should satisfy,
b2+c2+d2 = 1
which have an infinite number of real and rational solns, a subset of which are rationalized Pythagorean triples. The rational soln with the smallest denominator is {b,c,d} = ±{1,0,0}, in which case the quaternion reduces to the imaginary unit. The next smallest is ±{1,2,2}/3. Of course, the most general setting for solving x2 = -1 would be x as the octonions, where the coefficients of the non-real part would have to satisfy the sum of seven squares,
y12+y22+y32+y42+y52+y62+y72 = 1
and, if all yi are to be non-zero, the soln with the smallest denominator is ±{1,1,1,1,2,2,2}/4. (End update.)
Theorem (H. Monck): If a2+b2+c2 = d2, then (a+b+d)2 + (a+c+d)2 + (b+c+d)2 = (a+b+c+2d)2. Thus, one soln can generate others (with sign changes in a,b,c,d yielding several distinct ones), just like for Pythagorean triples. Q: Any similar identity for four squares or more?
Other versions for sums of three squares are,
A. Desboves (complete soln)
a2+b2+c2 = d2
{at, bt, ct, dt} = {2(p2-q2+r2), 2(p-q)2-2r2-2p(q-r), p2-(q-r)2-4r(p-q), 3(p2+q2+r2)-2q(2p+r)}
for arbitrary p,q,r and where t is just a scaling factor. (V. Lebesgue earlier gave a more complicated 6-parameter soln.) Proof (Piezas): For any soln a,b,c,d, one can always find rational p,q,r,t using the formulas,
{p,q,r,t} = {2a+2b, 3a-2d, a-2c, -8(2a-2b+c-3d)}
Piezas (complete)
t2(2u-v+2w)2 + t2(-u+2v-2w)2 + t2(-1+w)2 = t2(2u-2v+3w)2, where w = (u2+v2+1)/2
and t is a scaling factor. Since the eqn is homogenous, after some changes one can also use w = u2+v2+x2 though for simplicity it can be set x=1 without loss of generality. Proof: For any particular soln a,b,c,d, one can always find rational u,v,t given by,
{u,v} = {(2a-b-2d)/t, (-a+2b+2d)/t}, where t = -(2a-2b+c-3d)
Note that the scaling factor t is essentially the same as the one for Desboves. Partial solns in terms of binary quadratic forms can also be given,
A. Gerardin
(6x2-14xy+6y2)2 + (3x2-3y2)2 + (2x2-2y2)2 = (7x2-12xy+7y2)2
Notice that 62+32+22 = 72. This can be generalized as,
Piezas
(ax2-2dxy+ay2)2 + (bx2-by2)2 + (cx2-cy2)2 = (dx2-2axy+dy2)2, if a2+b2+c2 = d2
Euler, Lebesgue
(a2-b2-c2+d2)2 + (2ab-2cd)2 + (2ac+2bd)2 = (a2+b2+c2+d2)2
which is also known as the Lebesgue Three-Square Identity.
The square (a2+b2+c2+ab+ac+bc)2 can be identically expressed as the sum of 3 or 4 squares,
Catalan
((a+b)(a+c))2 + ((a+b)(b+c))2 + (ab-ac-bc-c2)2 = (a2+b2+c2+ab+ac+bc)2
J. Neuberg:
a2(a+b+c)2 + b2(a+b+c)2 + c2(a+b+c)2 + (ab+ac+bc)2 = (a2+b2+c2+ab+ac+bc)2
Likewise, (a2+b2+2c2)2 as 3 squares (in two ways), or 4 squares,
E. Catalan:
Page updated
Google Sites
Report abuse