<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>2345</id>
  <path>/www/nrich/html/content/04/weekly/prob21/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2010-12-10T09:31:02</last_published>
  <indexXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
&lt;p&gt;Given that $x$ and $y$ are positive whole numbers and $x^2 + 2 = y^3$, what possible values can $x$ take?&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;If you liked this problem, &lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=1163&quot;&gt;here is an NRICH task&lt;/a&gt; which challenges you to use similar mathematical ideas.&lt;/p&gt;&lt;/mdoxml&gt;</indexXML>
  <solutionXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;p&gt;x=5&lt;/p&gt;
&lt;p&gt;This is the only solution of the equation for which x and y are whole numbers. Another way of looking at this is to say that 26 is the only whole number &quot;sandwiched&quot; between a perfect square and a perfect cube. This was proved by the French mathematician, Pierre de Fermat, in the 17th Century.&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;&lt;/mdoxml&gt;</solutionXML>
  <noteXML/>
  <clueXML/>
  <canonXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;
    







&lt;p&gt;x=5&lt;/p&gt;
&lt;p&gt;This is the only solution of the equation for which x and y are
whole numbers. Another way of looking at this is to say that 26 is
the only whole number &amp;quot;sandwiched&amp;quot; between a perfect square and a
perfect cube. This was proved by the French mathematician, Pierre
de Fermat, in the 17th Century.&lt;/p&gt;


&lt;/mdoxml&gt;</canonXML>
  <end_user_role>2</end_user_role>
  <difficulty>3</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>0</keystage3>
  <keystage4>0</keystage4>
  <keystage4plus>0</keystage4plus>
  <title>Weekly Problem 51 - 2011</title>
  <description>
Weekly Problem 51 - 2011

</description>
</resource>