Can you sum fewer than k powers to equal another kth power?
In short: In 1778, Leonhard Euler proposed a bold generalization of Fermat's Last Theorem. He conjectured that to represent a number as a sum of kth powers, you need at least k terms. For two centuries, mathematicians searched for exceptions, only to find that Euler’s elegant rule eventually crumbles under computational scrutiny.
Euler's conjecture posited that for any integer k greater than 1, the equation involving the sum of n kth powers equaling another kth power required n to be at least k. This was intended as a natural extension of Fermat's Last Theorem, which covers the specific case where k equals 2. While the conjecture holds true for cubes, or k equals 3, it was eventually proven wrong for higher powers.
The first cracks appeared in 1966 when L. J. Lander and T. R. Parkin used a CDC 6600 computer to find a counterexample for k equals 5. Their discovery, published in a concise two-sentence paper, demonstrated that four fifth powers could sum to a fifth power, violating the requirement that n must be at least 5. Later, in 1986, Noam Elkies identified a counterexample for k equals 4, proving that three fourth powers could sum to a fourth power. Roger Frye subsequently used Elkies' methods to find the smallest possible solution for k equals 4 in 1988.
These findings shifted the mathematical landscape, leading to a revised conjecture by Lander, Parkin, and John Selfridge in 1967. They suggested that if a sum of n kth powers equals a sum of m kth powers, then the total number of terms m plus n must be at least k. Despite these advancements, the status of the original conjecture for values of k greater than or equal to 6 remains an open mystery. As of 2002, researchers have confirmed no solutions exist for k equals 6 where the final term is 730,000 or smaller, leaving the full extent of Euler's error yet to be determined.
The history of this problem highlights the transition from classical number theory to modern computational verification. While Euler provided solutions for the four cubes problem, the complexity of higher powers required the raw processing power of the 20th century to expose the limitations of his initial intuition.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Euler's sum of powers conjecture
To cite this card, link to https://intellectplus.co.uk/app/technology-euler-s-sum-of-powers-conjecture.
How we source, check and correct cards: Editorial standards.
General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.
Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?
Related
More in Inventions · More in Technology · Latest · A–Z · All topics