026: Seventh Powers (8, 9, 10 terms)

 Return to Index      PART 10.  Sum / Sums of Seventh Powers     7.1   Eight terms    For k = 7, the first soln to,   x1k + x2k + x3k + x4k = y1k + y2k + y3k + y4k        (eq.1)   was found in 1996 by Ekl as [10, 14, 123, 149] = [15, 90, 129, 146].  In 1999, Nuutti Kuosa found [184, 443, 556, 698] = [230, 353, 625, 673] for k = 1,3,7 though it seems he didn't realize it was multigrade.  (As it turns out, neither does it belong to the family given by Choudhry below.)   Update (6/26/09): Special forms:   a) x17 + x27 + x37 + x47 + x57 + x67 + x77 = x87   Only three solns are known to the case of 7 positive 7th powers equal to a 7th power, the first one found by Mark Dodrill in 1999:   1277 + 2587 + 2667 + 4137 + 4307 + 4397 + 5257  = 5687   b) x17 + x27 + x37 + x47 + x57 + x67 + x77 = 1   Just like three 3rd powers and five 5th powers, when signed, can sum to 1, so can seven 7th powers, two of which found by Kuosa,   [1, 1146, 1348, 2816] = [130, 1031, 1951, 2787] [1, 1140, 1823, 3189] = [485, 621, 1859, 3188]  (End note)   c) x17 + x27 + x37 + x47 + x57 + x67 + x77 = 0   Still unknown.  (Though since five 5th powers can sum to both zero and 1, it may be a general property of odd n nth powers for n > 3.)     A.J. Choudhry   Choudhry found a multi-variable cubic polynomial such that when it has a rational root, it yields a k = 1,3,7.  While no polynomial soln is yet known, it can be shown that if xi and yi are complex numbers with integer components, then there are families of polynomial solns (to be given later).  Given,  x1k + x2k + x3k + x4k = y1k + y2k + y3k + y4k,      (eq.1)   {x1, x2, x3, x4} = {a+b+c,  a-b-c, -a-b+c,  -a+b-c} {y1, y2, y3, y4} = {d+e+f,  d-e-f,  -d-e+f,  -d+e-f}  a form which gives x1+x2+x3+x4 = y1+y2+y3+y4 = 0.  Note that the xi (or yi) also satisfies,   5(x12+x22+x32+x42)(x13+x23+x33+x43) = 6(x15+x25+x35+x45)   Theorem 1:  Eq. 1 is true for k = 1,3,7 if it satisfies the two conditions, abc = def  2(a4+b4+c4) - 5(a2+b2+c2)2 = 2(d4+e4+f4) - 5(d2+e2+f2)2    This is the same form used by Chernick for ideal solns of k = 1,2,3 and Lander for fifth powers k = 1,3,5, though as one can see the condition is a little more complicated.  For the special case d+e = f, the system simplifies to satisfying the two eqns,   abc = de(d+e) 2(a4+b4+c4) - 5(a2+b2+c2)2 = 16(d2+de+e2)2   though whether this has non-trivial solns in the rationals is not known.  If there is, then one of the terms xi or yi vanishes so would be the first counter-example to Euler’s conjecture for seventh powers.  However, if this constraint is not given, after a clever substitution which reduced the problem to finding a rational root of a cubic, Choudhry found several solns to Theorem 1, one is {a,b,c,d,e,f} = {324, 5439, 893, 5217, 1539, 196} which gives,   [3328, 2111, -3004, -2435] = [3476, 1741, -3280, -1937]   which is for k = 1,3,7 as well as satisfying x1+x2+x3+x4 = y1+y2+y3+y4 = 0, and 5(z12+z22+z32+z42)(z13+z23+z33+z43) = 6(z15+z25+z35+z45) where zi = xi, (or zi = yi).    Note 1:  Kuosa's 1999 soln for k = 1,3,7 does not belong to this family as there is no transposition of four appropriate xi such that their sum is equal to zero. Note 2:  Theorem 1 can also be satisfied by ak+bk+ck = dk+ek+fk, for k = 2,4 where abc = def.  But, using resultants, it is easily proven that this restricted case has only trivial solns.     Piezas   Express eq.1 in the form F2,   (a+bh)k + (c+dh)k + (e+fh)k + (g+h)k = (a-bh)k + (c-dh)k + (e-fh)k + (g-h)k   To satisfy the side condition x1+x2 = y1+y2; x3+x4 = y3+y4 which is essentially the same as Choudhry’s, let {b,f} = {-d, -1}.  This makes it true for k = 1.  Expanding for k = 3, we find the eqn,   d = -(e2-g2)/(a2-c2)   Substituting this into k = 7 we get a quartic in h with only even exponents, call this H4, with coefficients in {a,c,e,g} as,    H4: = 3(v14-v34)h4 + 5(v12v4-v2v32)h2v12 + (a2c2-e2g2-v22+v42)v14 = 0   where {v1, v2, v3, v4} = {a2-c2, a2+c2, e2-g2, e2+g2}.  From Choudhry's result, we know H4 can have non-trivial rational roots, one of which is h = 98 when {a,c,e,g} = {3166, 2273, 3378, 1839}.  To find a polynomial identity, as was pointed out in the previous section, there are two ways to factor quartics with only even exponents, one of which is to make its discriminant a square.  One soln is a+c+e+g = 0.  Let {a,c,e,g} = {p+q+r, p-q-r, -p+q-r, -p-q+r} for symmetry, and H4 has the non-trivial quadratic factor,   3h2(q2+r2) + (5p2+3q2+3r2)(q+r)2 = 0   Unfortunately, this can only be solved by complex values.  If we let h = hi where i is the imaginary unit, then we are to find,   3(5p2+3q2+3r2)(q2+r2) = y2   As it is only a quadratic in p with a square constant term, this is easily done.  In summary, for the moment, only particular values (extrapolated from Choudhry's cubic) are known such that H4 has a non-trivial rational h.  If an appropriate general relation can be found between {a,c,e,g} such that H4 has a quadratic factor with real roots, then it may be possible to find an infinite family of polynomials for k = 1,3,7, just as there is one for k = 1,5.   Note:  For k = 1,3,5,7 with ten terms, a similar situation arose, a parametrization dependent on a multi-variable quartic polynomial with only even exponents.  However, this author was able to find two relations between the variables such that the quartic factored.  See discussion in the subsequent sections.     7.2  Nine terms   If x1 = 0, there are only two known primitive solns to,   x1k+x2k+x3k+x4k+x5k = y1k+y2k+y3k+y4k+y5k,  for k = 1,3,5,7   These lead to ideal solns of deg 8.  Interestingly, terms can be transposed such that x1+x2+x3+x4+x5 = y1+y2+y3+y4+y5 = 0. (There is a situation similar for k = 1,3,5 wherein the only known solns with x1 = 0 can be transposed in the same manner.  It is interesting to consider what the first k = 1,3,5,7,9 with x1 = 0 would look like.)  Letac in 1942  found the two,   [0, 34, 58, 82, 98] = [13, 16, 69, 75, 99] [0, 63, 119, 161, 169] = [8, 50, 132, 148, 174]   (How did he find it prior to computer searching?)  (Update, 8/15/09):  Christian Bau did a search for terms < 200 and James Waldby extended it to < 450 with no new primitive solns being found.)  It seems unknown if there is a parametric soln.  But there are two points to be noted.  First, as pointed out by Bailey et al, they can be transposed so an equal number of terms on either side sum to zero.  For the first, it is,   [0, -13, -16, -69, 98] = [75, 99, -34, -58, -82]   The second one has more "structure" as it can be re-arranged in four distinct ways,   [0, 63, 119, -8, -174] = [-161, -169, 148, 50, 132] [0, 63, 119, -50, -132] = [-161, -169, 148, 8, 174]   since 8+174 = 50+132, and,   [63, -50, -174, 161, 0] = [-119, 132, 148, -169, 8] [-119, 132, 148, -161, 0] = [63, -50, -174, 169, -8]    since 169-8 = 161-0.  As the left hand side involves only four terms, this (and only this side) also obeys,   5(x12+x22+x32+x42)(x13+x23+x33+x43) = 6(x15+x25+x35+x45)   a general identity first mentioned in k = 1,3,5.  Second point, for the first soln, re-arranged as,   [-99, -13, 0, 34, 98] = [-82, -58, 16, 69, 75]   Shuwen found this is good for one even exponent, k = 2.  Later we shall see that both these phenomena appear in the only (and presumably smallest) soln for k = 1,3,5,7,9.   Piezas   Conjecture:  "Define Fk:= x1k+x2k+x3k+x4k-(y1k+y2k+y3k+y4k+y5k) where x1+x2+x3+x4 = y1+y2+y3+y4+y5 = 0. If Fk = 0 for k = 1,3,5,7, then F22 = -2F4."   This works for the two known solns.  I don’t know whether this is true in general for systems of this form or is just a peculiarity of Letac’s method.      7.3 Ten terms   The next step is S7 and S8,   x1k+x2k+x3k+x4k+x5k = y1k+y2k+y3k+y4k+y5k   for k = 1,3,5,7, or k = 2,4,6,8.  It can be proven by computer search that the smallest solution to the first system, at least in distinct integers, is given by,   [3, 19, 37, 51, 53] = [9, 11, 43, 45, 55]   This turns to have already been known (pre-computer era) by Sinha as belonging to an infinite family.  However, there are just a few methods known to parametrically solve S7 (at least previously) and just one for S8, which is deplorable.  With the advent of computer algebra systems, the Internet, and hopefully more people working on the field of equal sums of like powers (ESLP), perhaps this can be rectified eventually.  Ironically, compared to S6, it seems solns to S7 are rather plentiful since while only one binary quadratic form identity (Chernick’s) is known for the former, three are known for the latter.  (Then again, it could be merely a lack of knowledge about S6.) 1st: The soln given by Sinha, (x-y+z)k + (-3x+y+z)k + (x-y-z)k + (-3x+y-z)k + (14x-y)k =(4x-3y)k + (-y)k + (11x-2y)k + (x+2y)k + (-6x+3y)k for k = 1,3,5,7,  if 126x2-5y2 = z2, D = 9(70).  2nd: One soln found by this author is the beautifully simple Sagan's Identity,   1 + 5k + (3+2y)k + (3-2y)k + (-3+3y)k + (-3-3y)k = (-2+x)k + (-2-x)k + (5-y)k + (5+y)k   for k = 1,3,5,7 if x2-10y2 = 9.    Note that this also satisfies x1+x2 = x3+x4 = -(x5+x6) as well as some other obvious ones.  While the complete soln uses rational x,y, if the condition is treated as a Pell eqn, then there are integral ones giving an infinite number of solns where two terms {1, 5} are constants.    Update, 11/7/09:  Last year, I dedicated an algebraic identity I found to the astronomer and science writer Carl Sagan (1934-1996).  I read his "Broca's Brain" and "The Dragons of Eden" in my late teens, and read and eventually saw "Contact".  Since I already dedicated one article I wrote on Degen's Eight-Square Identity to the novelist Katherine Neville, author of the amazing book "The Eight", I thought it was only fitting I name one of the identities I found after Sagan.  After all, it has billions and billions of solutions.  (You need to be a Sagan fan to understand the previous remark.)  Today is the first Carl Sagan Day, and I decided to revive the article I wrote about Sagan's Identity that perished when Geocities was closed by Yahoo last Oct. 26.  (End update.)   3rd: Also by this author,   (3x+2y)k + (-3x+7y)k + (3x-2)k + (3+2x)k + (-5x-3y)k = (-3x+2y)k + (3x+7y)k + (-3x-2)k + (3-2x)k + (5x-3y)k   for k = 1,2,3,5,7 if x2+6y2 = 1 which has the distinction of being valid for k = 2 as well.  All known parametrizations for k = 1,3,5,7 in terms of binary quadratic forms involve the unsigned square-free discriminants D = 6, 10, 70.  In short, the set D only employs the small prime factors p = 2,3,5,7.  Whether this is coincidence I do not know.      (Update, 1/25/10):   Piezas   Previously, it was seen how a k = 1,3,5 can lead to a k = 2,4,6.  This can be brought higher.  Given a (k.4.4) for k = 2,4,6, if its terms {xi , yi} are such that x1-x2 = y1-y2 = y2-y3 , then it can lead to a (k.5.5) for k = 1,3,5,7.  This is exemplified by the infinite family,   (3a+2b+c)k + (3a+2b-c)k + (-2a-b+d)k + (-2a-b-d)k = (3a+b+2c)k + (3a+b)k + (3a+b-2c)k + (-7a-b)k,  for k = 1,2,4,6   which leads to the higher system,   [3a+b+3c, 3a+2b-2c, -7a-b+c, -2a-b-c-d,  -2a-b-c+d]k = [3a+b-3c, 3a+2b+2c, -7a-b-c, -2a-b+c-d,  -2a-b+c+d]k,  for k = 1,2,3,5,7   where, for both, 10a2-b2 = c2, and 55a2-6b2 = d2, with trivial ratios a/b = {1, 1/3, 5/13}.  It is tempting to speculate that there may be higher-order version of this for (k.5.5), for k = 2,4,6,8.  (End update.)   It can be shown that given the system k = 1,3,5,7,   x1k+x2k+x3k+x4k+x5k = y1k+y2k+y3k+y4k+y5k   if it has either of the constraints,   1)      x1-x2 = x3-x4 = y1-y2  2)      x1+x2 = x3+x4 = y1+y2     (and equivalent forms after transposition such as the one above), then an infinite sequence of polynomial solns can be found by finding non-trivial rational points on a quartic polynomial that is to be made a square.     I. Constraint:  x1-x2 = x3-x4 = y1-y2  (where x1+x2+x3+x4+x5 = y1+y2+y3+y4+y5)   Here is a beautiful theorem by T. Sinha.  (See update in next page, bottom section.)  If,   (a+3c)k + (b+3c)k + (a+b-2c)k = (c+d)k + (c+e)k + (-2c+d+e)k,   for k = 2,4,   then,   ak + (a+2c)k + bk + (b+2c)k + (-c+d+e)k = (a+b-c)k + (a+b+c)k + dk + ek + (3c)k,   for k = 1,3,5,7,   excluding the trivial case c = 0.  Note that this also satisfies,   x1-x2 = x3-x4 = y1-y2 = -2c,  2(x1+x3) = y1+y2   x5 = y3+y4-(1/3)y5   a set of conditions which is enough to give the complete soln.  An example is,   {a,b,c,d,e} = {43, 9, 1, 19, 37}   yielding,   [43, 45, 9, 11, 55] = [51, 53, 19, 37, 3]   which is the smallest solution mentioned previously.  Sinha’s problem then is to solve,   p1k+p2k+p3k = q1k+q2k+q3k   for k = 2,4 where p1+p2-p3 = 2(q1+q2-q3) ≠ 0.  He gave a single polynomial soln to this in terms of binary quadratic forms but this author showed there are two such solns, though there could be more.     1. (-5x+2y+z)k + (-5x+2y-z)k + (6x-4y)k = (9x-y)k + (-x+3y)k + (16x-2y)k   where 126x2-5y2 = z2,  D = 9(70).  (Sinha’s)   2. (6x+3y)k + (4x+9y)k + (2x-12y)k = (-x+3y+3z)k + (-x+3y-3z)k + (-6x-6y)k   where x2+10y2 = z2,  D = -10.  (This one, after minor changes, gives the example at the start of this section.)   where D is the discriminant of the binary quadratic form.  Furthermore, treated as rational points on a certain elliptic curve, it can be showed that an infinite sequence can be derived from these thus providing polynomial solns of increasing degree.  (See discussion on Fourth Powers.)  The example below is based on Sinha’s soln [1],   (x-y+z)k + (-3x+y+z)k + (x-y-z)k + (-3x+y-z)k + (14x-y)k = (4x-3y)k + (-y)k + (11x-2y)k + (x+2y)k + (-6x+3y)k   for k = 1,3,5,7,  if 126x2-5y2 = z2.    Note:  To compare, for eighth powers, other than the Letac-Sinha identity, there are only two solns known found by computer search with all terms xi < 520.  One obeys the same constraints as Sinha’s identity, x1-x2 = x3-x4 = y1-y2, (and an additional x4-x2 = y4-y2).  This is,   [366, 103, 452, 189, -515] = [508, 245, -18, 331, -471],  for k = 1,2,4,6,8   but whether this has a parametric soln is unknown.     II. Constraint:  x1+x2 = x3+x4 = y1+y2  (where x1+x2+x3+x4+x5 = y1+y2+y3+y4+y5)   An example is one by Gloden,   [9, 45, 11, 43, 55] = [3, 51, 19, 37, 53]   based on an identity given in the next section and simple transposition of terms,   [-51, 9, 11, 55, -53] = [3, -45, -43, 19, 37]   gives the equivalent rule,   x1-y1 = -(x2-y2) = -(x3-y3)   useful for the case k = 1,2,3,5,7, like this numerical example by Shuwen,    {-71, 143, -17, -163, 121} = {103, -31, 157, -47, -169}   One can use this to find a polynomial identity.  This eqn has a lot of structure. Expressed in terms of xi and yi, then,   x1-y1 = -(x2-y2) = x3-y3 x32+x42 = y32+y42   the first of which, after negating, is the same as Gloden’s.  Using these constraints, we find the identity given earlier,   (3x+2y)k + (-3x+7y)k + (3x-2)k + (3+2x)k + (-5x-3y)k = (-3x+2y)k + (3x+7y)k + (-3x-2)k + (3-2x)k + (5x-3y)k   for k = 1,2,3,5,7, if x2+6y2 = 1.  Shuwen's was just the case {x,y} = {29/35, 8/35}, though some rational values should be avoided as they are trivial.  However, one can find a more general result,     ◄
Comments