<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Euler&#039;s sum of powers conjecture - Page 7 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Euler's_sum_of_powers_conjecture&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Euler%27s_sum_of_powers_conjecture&amp;p=8">3.Next</a>
</p>
<p>conjectured that if <br/>
:,where  are positive integers for all  and , then .  In the special case , the conjecture states that if<br/>
:(under the conditions given above) then .</p>

<p>The special case may be described as the problem of giving a <a href="page.php?w=integer_partition">partition</a> of a perfect power into few like powers.  For  and  or , there are many known solutions.  Some of these are listed below. </p>

<p>See  for more data.</p>

<p><big>From Fermat's Last Theorem, we know that there can't be a solution to .(The minimum positive value of a sum of third powers is , which provides a solution to the equation (a = (1, 6, 8), b = 9), where however the smallest member isn't larger than 1.)The smallest solution with terms > 1 is (<a href="page.php?w=Plato%27s_number">Plato's number</a> 216)This is the case ,  of <a href="page.php?w=Srinivasa_Ramanujan">Srinivasa Ramanujan</a>'s formula A cube as the sum of three cubes can also be parameterized in one of two ways:The number 2,100,000<sup>3</sup> can be expressed as the sum of three positive cubes in nine different ways.<p><big>(R. Frye, 1988); (R. Norrie, smallest, 1911).<p><big>(Lander & Parkin, 1966); (Lander, Parkin, Selfridge, smallest, 1967); (Lander, Parkin, Selfridge, second smallest, 1967); (Sastry, 1934, third smallest).<p><big>It has been known since 2002 that there are no solutions for  whose final term is <= 730000.<p><big>(M. Dodrill, 1999).<p><big>(S. Chase, 2000).<p><big>See also</big></p>
* <a href="page.php?w=Jacobi-Madden_equation">Jacobi-Madden equation</a>*<a href="page.php?w=Prouhet-Tarry-Escott_problem">Prouhet-Tarry-Escott problem</a>*<a href="page.php?w=Beal_conjecture">Beal conjecture</a>*<a href="page.php?w=Pythagorean_quadruple">Pythagorean quadruple</a>*<a href="page.php?w=Generalized_taxicab_number">Generalized taxicab number</a>*<a href="page.php?w=Sums_of_powers">Sums of powers</a>, a list of related conjectures and theorems<p><big> References </big></p>
<p><big> External links </big></p>
* Tito Piezas III,  * Jaroslaw Wroblewski, * Ed Pegg Jr., * James Waldby,  * <a href="page.php?w=Robert_Gerbicz">R. Gerbicz</a>, J.-C. Meyrignac, U. Beckert, * * * * *  at library.thinkquest.org*  at Maths Is Good For You!
<p>
<a accesskey="1" href="page.php?w=Euler's_sum_of_powers_conjecture&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Euler%27s_sum_of_powers_conjecture&amp;p=8">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
