# Lander, Parkin, and Selfridge conjecture

The Lander, Parkin, and Selfridge conjecture concerns the integer solutions of equations which contain sums of like powers. The equations are generalisations of those considered in Fermat's Last Theorem. The conjecture is that if the sum of some k-th powers equals the sum of some other k-th powers, then the total number of terms in both sums combined must be at least k.

## Background

Diophantine equations, such as the integer version of the equation a2 + b2 = c2 that appears in the Pythagorean theorem, have been studied for their integer solution properties for centuries. Fermat's Last Theorem states that for powers greater than 2, the equation ak + bk = ck has no solutions in non-zero integers a, b, c. Extending the number of terms on either or both sides, and allowing for higher powers than 2, led to Leonhard Euler to propose in 1769 that for all integers n and k greater than 1, if the sum of n kth powers of positive integers is itself a kth power, then n is greater than or equal to k.

In symbols, if ${\displaystyle \sum _{i=1}^{n}a_{i}^{k}=b^{k}}$ where n > 1 and ${\displaystyle a_{1},a_{2},\dots ,a_{n},b}$ are positive integers, then his conjecture was that nk.

In 1966, a counterexample to Euler's sum of powers conjecture was found by Leon J. Lander and Thomas R. Parkin for k = 5:[1]

275 + 845 + 1105 + 1335 = 1445.

In subsequent years, further counterexamples were found, including for k = 4. The latter disproved the more specific Euler quartic conjecture, namely that a4 + b4 + c4 = d4 has no positive integer solutions. In fact, the smallest solution, found in 1988, is

4145604 + 2175194 + 958004 = 4224814.

## Conjecture

In 1967, L. J. Lander, T. R. Parkin, and John Selfridge conjectured[2] that if ${\displaystyle \sum _{i=1}^{n}a_{i}^{k}=\sum _{j=1}^{m}b_{j}^{k}}$, where ai  bj are positive integers for all 1  i  n and 1  j  m, then m+n  k. The equal sum of like powers formula is often abbreviated as (k, m, n).

Small examples with ${\displaystyle m=n={\frac {k}{2}}}$ (related to generalized taxicab number) include ${\displaystyle 59^{4}+158^{4}=133^{4}+134^{4}}$ (known to Euler) and ${\displaystyle 3^{6}+19^{6}+22^{6}=10^{6}+15^{6}+23^{6}}$ (found by K. Subba Rao in 1934).

The conjecture implies in the special case of m = 1 that if

${\displaystyle \sum _{i=1}^{n}a_{i}^{k}=b^{k}}$

(under the conditions given above) then n  k  1.

For this special case of m = 1, some of the known solutions satisfying the proposed constraint with n  k, where terms are positive integers, hence giving a partition of a power into like powers, are:[3]

k = 3
33 + 43 + 53 = 63.
k = 4
958004 + 2175194 + 4145604 = 4224814, (Roger Frye, 1988)
304 + 1204 + 2724 + 3154 = 3534, (R. Norrie, 1911)

Fermat's Last Theorem states that in this case the conjecture is true.

k = 5
275 + 845 + 1105 + 1335 = 1445, (Lander, Parkin, 1966)
75 + 435 + 575 + 805 + 1005 = 1075, (Sastry, 1934, third smallest)
k = 6
(None known. As of 2002, there are no solutions whose final term is ≤ 730000.[4] )
k = 7
1277 + 2587 + 2667 + 4137 + 4307 + 4397 + 5257 = 5687, (M. Dodrill, 1999)
k = 8
908 + 2238 + 4788 + 5248 + 7488 + 10888 + 11908 + 13248 = 14098, (Scott Chase, 2000)
k ≥ 9
(None known.)

## Current status

It is not known if the conjecture is true, or if solutions exist that would be counterexamples, such as ak + bk = ck + dk for k  5.

4. Giovanni Resta and Jean-Charles Meyrignac (2002). The Smallest Solutions to the Diophantine Equation ${\displaystyle a^{6}+b^{6}+c^{6}+d^{6}+e^{6}=x^{6}+y^{6}}$, Mathematics of Computation, v. 72, p. 1054 (See further work section).