Euler's sum of powers conjecture
Euler's sum of powers conjecture
Main page

Euler's sum of powers conjecture

logo
Community Hub0 subscribers

Euler's sum of powers conjecture

logo
Community Hub0 subscribers
What are your thoughts?
Be the first to start a discussion here.
Be the first to start a discussion here.
Euler's sum of powers conjecture

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 kth powers of positive integers is itself a kth power, then n is greater than or equal to k:

The conjecture represents an attempt to generalize Fermat's Last Theorem, which is the special case n = 2: if then 2 ≥ k.

Although the conjecture holds for the case k = 3 (which follows from Fermat's Last Theorem for the third powers), it was disproved for k = 4 and k = 5. It is unknown whether the conjecture fails or holds for any value k ≥ 6.

Euler was aware of the equality 594 + 1584 = 1334 + 1344 involving sums of four fourth powers; this, however, is not a counterexample because no term is isolated on one side of the equation. He also provided a complete solution to the four cubes problem as in Plato's number 33 + 43 + 53 = 63 or the taxicab number 1729. The general solution of the equation is

where a, b and are any rational numbers.

Euler's conjecture was disproven by L. J. Lander and T. R. Parkin in 1966 when, through a direct computer search on a CDC 6600, they found a counterexample for k = 5. This was published in a paper comprising just two sentences. A total of three primitive (that is, in which the summands do not all have a common factor) counterexamples are known: (Lander & Parkin, 1966); (Scher & Seidl, 1996); (Frye, 2004).

See all
User Avatar
No comments yet.