Euler's sum of powers conjecture

Euler's conjecture is a disproved conjecture in mathematics related to Fermat's last theorem which was proposed by Leonhard Euler in 1769. It states 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 not smaller than "k".

In symbols, ifsum_{i=1}^{n} a_i^k = b^kwhere n>1 and a_1, a_2, dots, a_n, b are positive integers, then ngeq k.

The conjecture was disproven by L. J. Lander and T. R. Parkin in 1966 when they found the following counterexample for "k" = 5:

::275 + 845 + 1105 + 1335 = 1445.

In 1986, Noam Elkies found a method to construct counterexamples for the "k" = 4 case. His smallest counterexample was the following:

::26824404 + 153656394 + 187967604 = 206156734.

In 1988, Roger Frye subsequently found the smallest possible "k" = 4 counterexample by a direct computer search using techniques suggested by Elkies:

::958004 + 2175194 + 4145604 = 4224814.

In 1966, L. J. Lander, T. R. Parkin, and John Selfridge conjectured that for every k>3,if sum_{i=1}^{n} a_i^k = sum_{j=1}^{m} b_j^k, where a_i e b_j are positive integers for all 1leq ileq n and 1leq jleq m, then m + n geq k.

ee also

*Euler's equation of degree four

External links

* [http://euler.free.fr/ EulerNet: Computing Minimal Equal Sums Of Like Powers]
* [http://mathworld.wolfram.com/EulerQuarticConjecture.html Euler Quartic Conjecture] at MathWorld
* [http://mathworld.wolfram.com/DiophantineEquation4thPowers.html Diophantine Equation — 4th Powers] at MathWorld
* [http://library.thinkquest.org/28049/Euler's%20conjecture.html Euler's Conjecture] at library.thinkquest.org
* [http://www.mathsisgoodforyou.com/conjecturestheorems/eulerconjecture.htm A simple explanation of Euler's Conjecture] at Maths Is Good For You!
* [http://www.sciencedaily.com/releases/2008/03/080314145039.htm Mathematicians Find New Solutions To An Ancient Puzzle]


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Euler's equation of degree four — is a mathematical problem proposed by Leonhard Euler in 1772. [ [http://www.upi.com/NewsTrack/Science/2008/03/19/eulers equation of degree four solved/8804/ Euler s equation of degree four solved UPI.com ] ] The problem, which deals with number… …   Wikipedia

  • Euler's conjecture — The great mathematician Leonard Euler (1707 1783) made several different conjectures which are all called Euler s conjecture:*Euler s sum of powers conjecture *Euler s conjecture (Waring s problem) …   Wikipedia

  • List of mathematics articles (E) — NOTOC E E₇ E (mathematical constant) E function E₈ lattice E₈ manifold E∞ operad E7½ E8 investigation tool Earley parser Early stopping Earnshaw s theorem Earth mover s distance East Journal on Approximations Eastern Arabic numerals Easton s… …   Wikipedia

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

  • List of topics named after Leonhard Euler — In mathematics and physics, there are a large number of topics named in honour of Leonhard Euler (pronounced Oiler ). As well, many of these topics include their own unique function, equation, formula, identity, number (single or sequence), or… …   Wikipedia

  • List of conjectures — This is an incomplete list of mathematical conjectures. They are divided into four sections, according to their status in 2007. See also: * Erdős conjecture, which lists conjectures of Paul Erdős and his collaborators * Unsolved problems in… …   Wikipedia

  • List of important publications in mathematics — One of the oldest surviving fragments of Euclid s Elements, found at Oxyrhynchus and dated to circa AD 100. The diagram accompanies Book II, Proposition 5.[1] This is a list of important publications in mathematics, organized by field. Some… …   Wikipedia

  • Goldbach's conjecture — is one of the oldest unsolved problems in number theory and in all of mathematics. It states::Every even integer greater than 2 can be written as the sum of two primes.Expressing a given even number as a sum of two primes is called a Goldbach… …   Wikipedia

  • Waring's problem — In number theory, Waring s problem, proposed in 1770 by Edward Waring, asks whether for every natural number k there exists an associated positive integer s such that every natural number is the sum of at most s k th powers of natural numbers… …   Wikipedia

  • History of mathematics — A proof from Euclid s Elements, widely considered the most influential textbook of all time.[1] …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”