<?xml version="1.0" encoding="ISO-8859-1" ?>
  <resource>
  <id>260</id>
  <path>/www/nrich/html/content/99/04/15plus1/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2011-02-01T00:00:01</last_published>
  <indexXML>&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
&lt;p&gt;Find the smallest integer solution to the following equation:&lt;/p&gt;
&lt;p&gt;$$\frac {1}{x^2}+\frac {1}{y^2}=\frac {1}{z^2}$$&lt;/p&gt;
&lt;p&gt;&lt;br&gt;&lt;/br&gt;
 &lt;/p&gt;&lt;/mdoxml&gt;</indexXML>
  <solutionXML>&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;p&gt;&amp;quot;Hello. I'm Kim Jinhyuna from Kingston-Grammar School. I would
like to inform you that I have worked out the question 'Upsetting
Pitagoras'. The mathematical problem has an infinite number of
solutions. Let $x=1$ and $y=2$. Then $${1\over x^2}+{1\over y^2}=
{1\over 1^2}+{1\over 2^2} = 1{\cdot}25 = {1\over 0{\cdot}8}.$$ So
$z^2 = 0{\cdot}8$, and $z = \sqrt{0{\cdot}8}$ which gives $z=\pm
0{\cdot}894$ to 3 significant figures. For another solution, let
Let $x=3$ and $y=4$. Then $${1\over x^2}+{1\over y^2}= {1\over
3^2}+{1\over 4^2} = 1{\cdot}736\ldots = {1\over 5{\cdot}76}.$$ So
$z^2 = 5{\cdot}76$, and $z = \sqrt{5{\cdot}76}$ which gives $z=\pm
2{\cdot}4$ (exactly). However, I think that the problem comes with
the assumption that $x$, $y$ and $z$ are all integers, in which
case one answer is $x=30$, $y=40$ and $z=24$; that is $${1\over
30^2}+{1\over 40^2} = {1\over 24^2}.$$ If we multiply both sides by
$4$ we get $${1\over 15^2}+{1\over 20^2} = {1\over 12^2}.$$ I'm
looking forward to more tough and hard questions.&amp;quot; &lt;/p&gt;
&lt;p&gt;You can also use &lt;a href=&quot;../public/viewer.php?obj_id=1309&quot;&gt;Pythagorean Triples&lt;/a&gt; to find
the smallest integer solution to the equation:&lt;/p&gt;
If $a^2 + b^2 = c^2$ then $${1\over b^2c^2} + {1\over a^2c^2} =
{1\over a^2b^2}.$$ So every Pythgorean triple gives rise to a
solution to our problem. The smallest solution of this type arises
from $a=3, b=4, c=5$ and gives $${1\over 20^2} + {1\over 15^2} =
{1\over 12^2}.$$ Notice we have not proved that there is no other
way of producing solutions but a simple computer program to make an
exhaustive check of values of $x, y$ and $z$ up to these values
will prove that there are no smaller solutions. &lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</solutionXML>
  <noteXML/>
  <clueXML>&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;p&gt;Take a cue from the title!&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;Can you in any way use $a$, $b$ and $c$ where you know $a^2 + b^2 = c^2$?&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;No knowledge is needed here, only mathematical reasoning. It is an important point to make that finding a method for producing solutions does not prove that there is no other method and no smaller solution generated another way. However, once you have found what you believe to be the smallest solution, it is possible to check numerically that there are in fact no smaller solutions.&lt;/p&gt;&lt;/mdoxml&gt;</clueXML>
  <canonXML/>
  <end_user_role>2</end_user_role>
  <difficulty>3</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>0</keystage3>
  <keystage4>1</keystage4>
  <keystage4plus>1</keystage4plus>
  <title>Upsetting Pitagoras</title>
  <description>Find the smallest integer solution to the equation: 1/x^2 + 1/y^2 =
1/z^2</description>
  <spec_group>Admin
    <specifier>Short problems</specifier>
  </spec_group>
  <spec_group>Numbers and the Number System
    <specifier>Integers</specifier>
  </spec_group>
  <spec_group>Algebra
    <specifier>Diophantine equations</specifier>
  </spec_group>
  <spec_group>2D Geometry, Shape and Space
    <specifier>Pythagorean triples</specifier>
  </spec_group>
</resource>