Lander, Parkin, and Selfridge conjecture

Last updated October 16, 2024

In number theory, 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 $a 2 + b 2 = c 2$ 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 $a k + b k = c k$ 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 k$ th powers of positive integers is itself a $k$ th power, then $n$ is greater than or equal to $k$ .

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

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 + 84 5 + 110 5 + 133 5 = 1445

.

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

4145604 + 217519 4 + 95800 4 = 422481 4

.

Conjecture

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

Small examples with $m=n={\tfrac {k}{2}}$ (related to generalized taxicab number) include

594 + 158 4 = 133 4 + 134 4

(known to Euler)

and

36 + 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 $\sum _{i=1}^{n}a_{i}^{k}=b^{k}$ (under the conditions given above) then $n \geq k - 1$ .

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

$k = 3$

33 + 4 3 + 5 3 = 6 3

$k = 4$

958004 + 217519 4 + 414560 4 = 422481 4

(Roger Frye, 1988)

304 + 120 4 + 272 4 + 315 4 = 353 4

(R. Norrie, 1911)

Fermat's Last Theorem implies that for $k = 4$ the conjecture is true.

$k = 5$

275 + 84 5 + 110 5 + 133 5 = 144 5

(Lander, Parkin, 1966)

75 + 43 5 + 57 5 + 80 5 + 100 5 = 107 5

(Sastry, 1934, third smallest)

$k = 6$

(None known. As of 2002, there are no solutions whose final term is

\leq 730000

.^[4] )

$k = 7$

1277 + 258 7 + 266 7 + 413 7 + 430 7 + 439 7 + 525 7 = 568 7

(M. Dodrill, 1999)

$k = 8$

908 + 223 8 + 478 8 + 524 8 + 748 8 + 1088 8 + 1190 8 + 1324 8 = 1409 8

(Scott Chase, 2000)

$k \geq 9$

(None known.)

Current status

It is not known if the conjecture is true, or if nontrivial solutions exist that would be counterexamples, such as $a k + b k = c k + d k$ for $k \geq 5$ . ^[5]^[6]

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 number theory, Euler's conjecture is a disproved conjecture related to Fermat's Last Theorem. It was proposed by Leonhard Euler in 1769. It states that for all integers $n$ and $k$ greater than 1, if the sum of $n$ many $k$ th powers of positive integers is itself a $k$ th power, then $n$ is greater than or equal to $k$ :

In mathematics, a transcendental number is a real or complex number that is not algebraic – that is, not the root of a non-zero polynomial with integer coefficients. The best-known transcendental numbers are $π$ and $e$ . The quality of a number being transcendental is called transcendence.

Catalan's conjecture (or Mihăilescu's theorem) is a theorem in number theory that was conjectured by the mathematician Eugène Charles Catalan in 1844 and proven in 2002 by Preda Mihăilescu at Paderborn University. The integers 2³ and 3² are two perfect powers (that is, powers of exponent higher than one) of natural numbers whose values (8 and 9, respectively) are consecutive. The theorem states that this is the only case of two consecutive perfect powers. That is to say, that

The abc conjecture is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985. It is stated in terms of three positive integers and that are relatively prime and satisfy . The conjecture essentially states that the product of the distinct prime factors of is usually not much smaller than . A number of famous conjectures and theorems in number theory would follow immediately from the abc conjecture or its versions. Mathematician Dorian Goldfeld described the abc conjecture as "The most important unsolved problem in Diophantine analysis".

The modularity theorem states that elliptic curves over the field of rational numbers are related to modular forms in a particular way. Andrew Wiles and Richard Taylor proved the modularity theorem for semistable elliptic curves, which was enough to imply Fermat's Last Theorem. Later, a series of papers by Wiles's former students Brian Conrad, Fred Diamond and Richard Taylor, culminating in a joint paper with Christophe Breuil, extended Wiles's techniques to prove the full modularity theorem in 2001.

144 is the natural number following 143 and preceding 145. 144 is a dozen dozens, or one gross. 144 is the twelfth Fibonacci number and the only nontrivial of these that is square.

In arithmetic and algebra, the fourth power of a number n is the result of multiplying four instances of n together. So:

The Beal conjecture is the following conjecture in number theory:

<span class="mw-page-title-main">Congruum</span> Spacing between equally-spaced square numbers

In number theory, a congruum is the difference between successive square numbers in an arithmetic progression of three squares. That is, if $,, and are three square numbers that are equally spaced apart from each other, then the spacing between them,, is called a congruum.$

A Pythagorean quadruple is a tuple of integers $a$ , $b$ , $c$ , and $d$ , such that $a 2 + b 2 + c 2 = d 2$ . 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.

In mathematics and statistics, sums of powers occur in a number of contexts:

In mathematics, the Prouhet–Tarry–Escott problem asks for two disjoint multisets A and B of n integers each, whose first k power sum symmetric polynomials are all equal. That is, the two multisets should satisfy the equations

The Jacobi–Madden equation is the Diophantine equation

<span class="mw-page-title-main">Fermat's Last Theorem</span> 17th-century conjecture proved by Andrew Wiles in 1994

In number theory, Fermat's Last Theorem states that no three positive integers $a$ , $b$ , and $c$ satisfy the equation $a n + b n = c n$ for any integer value of $n$ greater than $2$ . The cases $n = 1$ and $n = 2$ have been known since antiquity to have infinitely many solutions.

In number theory, the Fermat–Catalan conjecture is a generalization of Fermat's Last Theorem and of Catalan's conjecture. The conjecture states that the equation

Fermat's Last Theorem is a theorem in number theory, originally stated by Pierre de Fermat in 1637 and proven by Andrew Wiles in 1995. The statement of the theorem involves an integer exponent $n$ larger than 2. In the centuries following the initial statement of the result and before its general proof, various proofs were devised for particular values of the exponent $n$ . Several of these proofs are described below, including Fermat's proof in the case $n = 4$ , which is an early example of the method of infinite descent.

In arithmetic and algebra, the fifth power or sursolid of a number n is the result of multiplying five instances of n together:

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

References

↑ L. J. Lander; T. R. Parkin (1966). "Counterexample to Euler's conjecture on sums of like powers". Bull. Amer. Math. Soc. 72: 1079. doi: 10.1090/S0002-9904-1966-11654-3 .
↑ L. J. Lander; T. R. Parkin; J. L. Selfridge (1967). "A Survey of Equal Sums of Like Powers". Mathematics of Computation . 21 (99): 446–459. doi: 10.1090/S0025-5718-1967-0222008-0 . JSTOR 2003249.
↑ Quoted in Meyrignac, Jean-Charles (14 February 2001). "Computing Minimal Equal Sums Of Like Powers: Best Known Solutions" . Retrieved 17 July 2017.
↑ Giovanni Resta and Jean-Charles Meyrignac (2002). The Smallest Solutions to the Diophantine Equation $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).
↑ A. Bremner; R. K. Guy (1998). "A Dozen Difficult Diophantine Dilemmas". American Mathematical Monthly . 95 (1): 31–36. doi:10.2307/2323442. JSTOR 2323442.
↑ T.D. Browning (2002). "Equal sums of two kth powers". Journal of Number Theory . 96 (2): 293–318.

Guy, Richard K. (2004). Unsolved Problems in Number Theory. Problem Books in Mathematics (3rd ed.). New York, NY: Springer-Verlag. D1. ISBN 0-387-20860-7. Zbl 1058.11001.

External links

EulerNet: Computing Minimal Equal Sums Of Like Powers
Jaroslaw Wroblewski Equal Sums of Like Powers
Tito Piezas III: A Collection of Algebraic Identities
Weisstein, Eric W. "Diophantine Equation--5th Powers". MathWorld .
Weisstein, Eric W. "Diophantine Equation--6th Powers". MathWorld .
Weisstein, Eric W. "Diophantine Equation--7th Powers". MathWorld .
Weisstein, Eric W. "Diophantine Equation--8th Powers". MathWorld .
Weisstein, Eric W. "Euler's Sum of Powers Conjecture". MathWorld .
Weisstein, Eric W. "Euler Quartic Conjecture". MathWorld .
Weisstein, Eric W. "Diophantine Equation--4th Powers". MathWorld .
Euler's Conjecture at library.thinkquest.org
A simple explanation of Euler's Conjecture at Maths Is Good For You!
Mathematicians Find New Solutions To An Ancient Puzzle
Ed Pegg Jr. Power Sums, Math Games

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] L. J. Lander; T. R. Parkin (1966). "Counterexample to Euler's conjecture on sums of like powers". Bull. Amer. Math. Soc. 72: 1079. doi: 10.1090/S0002-9904-1966-11654-3 .

[2] L. J. Lander; T. R. Parkin; J. L. Selfridge (1967). "A Survey of Equal Sums of Like Powers". Mathematics of Computation . 21 (99): 446–459. doi: 10.1090/S0025-5718-1967-0222008-0 . JSTOR 2003249.

[meyrignac-3] Quoted in Meyrignac, Jean-Charles (14 February 2001). "Computing Minimal Equal Sums Of Like Powers: Best Known Solutions" . Retrieved 17 July 2017.

[4] Giovanni Resta and Jean-Charles Meyrignac (2002). The Smallest Solutions to the Diophantine Equation $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).

[5] A. Bremner; R. K. Guy (1998). "A Dozen Difficult Diophantine Dilemmas". American Mathematical Monthly . 95 (1): 31–36. doi:10.2307/2323442. JSTOR 2323442.

[6] T.D. Browning (2002). "Equal sums of two kth powers". Journal of Number Theory . 96 (2): 293–318.

[1]

[2]

[3]

[4]

[5]

[6]