<?xml version="1.0" encoding="ISO-8859-1" ?>
  <resource>
  <id>249</id>
  <path>/www/nrich/html/content/99/01/15plus1/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2011-02-01T00:00:01</last_published>
  <indexXML>&lt;mdoxml version=&quot;1.0&quot;&gt;
    







&lt;p&gt;What is the smallest perfect square that ends with the four
digits 9009?&lt;/p&gt;


&lt;/mdoxml&gt;</indexXML>
  <solutionXML>&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
&lt;span class=&quot;editorial&quot;&gt;Peter of Madras College, St Andrew's
employed an exhaustive search to find&lt;/span&gt; the smallest perfect
square that ends in 9009 and came up with the answer 1503.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
I first noted that the last digit has to be a 3 or a 7 for the
square to end in 9. Noting that the last two digits of $x^2$ are
only affected by the last two digits of $x$. I then systematically
went through all the squares. &lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
I kept a record of the numbers tried in two tree diagrams starting
from the units digits 3 and 7. If any of these produced a number
that ended in 09 then I marked that as the next branch point on the
diagram.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
I then went on to further generations looking for numbers ending in
009, and then finally the next generation looking for numbers
ending in 9009. I found that there are no numbers with 3 digits or
less whose squares end in 9009 and the four digit numbers are 1503,
6503, 2753, 7753, 2247, 7247, 3497 and 8497. &lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;p&gt;&lt;span class=&quot;editorial&quot;&gt;Alternatively suppose $x^2 = 100a + 10b
+ c$ where $a$, $b$ and $c$ are whole numbers, $a \geq 1$ and $b$
and $c$ are between 0 and 9 inclusive.&lt;/span&gt;&lt;/p&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$$x^2 - 9 = (x - 3)(x + 3) = \star\star\star\star9000$$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
As 10 divides the right hand side of this expression we know 10
divides $x - 3$ or $x + 3$. Thus $x$ ends in a 3 or a 7.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;text-decoration: underline; font-weight: bold;&quot;&gt;Case
1: c = 3&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$(100a + 10b + 3)^2 = 10000a^2 + 200a(10b + 3) + 100b^2 + 60b + 9$
ends in 9009 Subtract 9, then take modulo 100.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$$\eqalign{ \Rightarrow 60b &amp;amp;\equiv 0 \qquad \mbox{(mod 100)}\\
\Rightarrow 3b &amp;amp;\equiv 0 \qquad \mbox{(mod 5)}\\ \Rightarrow b
&amp;amp;= 0 \; or \; 5.}$$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-weight: bold;&quot;&gt;If c = 3 and b = 0:&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$(100a + 3)^2$ ends in 9009&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$$\eqalign{ \Rightarrow 600a &amp;amp;\equiv 9000 \qquad \mbox{(mod
10000)} \\ \Rightarrow 6a &amp;amp;\equiv 90 \qquad \mbox{(mod 100)} \\
\Rightarrow 3a &amp;amp;\equiv 45 \qquad \mbox{(mod 50)} \\ \Rightarrow
a &amp;amp;= 15 + 50k \\ \Rightarrow \mbox{smallest} \; a &amp;amp;= 15;\;
x = 1503.}$$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-weight: bold;&quot;&gt;If c = 3 and b = 5:&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$(100a + 53)^2$ ends in 9009 $10000a^2 + 10600a + 2809$ ends in
9009 $100a^2 + 106a + 28$ ends in 90&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$$\eqalign{ \Rightarrow 6a + 28 &amp;amp;\equiv 90 \qquad \mbox{(mod
100)} \\ \Rightarrow 3a &amp;amp;\equiv 31 \qquad \mbox{(mod 50)} \\
\Rightarrow 3a &amp;amp;= 31 + 50k \qquad \mbox{where k and a are non
negative integers.} \\ \Rightarrow \mbox{smallest} \; a &amp;amp;=
27;\; x = 2753 \quad \mbox{which is not minimal.}}$$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-weight: bold; text-decoration: underline;&quot;&gt;Case
2: c = 7&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$(100a + 10b + 7)^2 = 10000a^2 + 200a(10b + 7) + 100b^2 + 140b +
49$ ends in 9009.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$$\eqalign{ \Rightarrow 40b + 40 &amp;amp;\equiv 0 \qquad \mbox{(mod
100)} \\ \Rightarrow 2b + 2 &amp;amp;\equiv 0 \qquad \mbox{(mod 5)} \\
\Rightarrow b &amp;amp;= 4\; \mbox{or}\; 9}$$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
In the cases $c$ = 7 and $b$ = 4 or 9 there are no solutions less
than 1503.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</solutionXML>
  <noteXML/>
  <clueXML>&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;br&gt;&lt;/br&gt;
&lt;p&gt;Try to be systematic. How can you narrow down the cases to be tested?&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;If the last digit of a square number is 9 what can you say about the number?&lt;/p&gt;
&lt;p&gt;Can you write down an expression for a number using its digits and powers of 10?&lt;br&gt;&lt;/br&gt;
Possible support&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;Note: Other problems using modulus arithmetic: &lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=1933&amp;amp;part=index&quot;&gt;Dirisibly Yours&lt;/a&gt; , &lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=1966&amp;amp;part=index&quot;&gt;Obviously,&lt;/a&gt; &lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=1943&amp;amp;part=index&quot;&gt;Rational Round&lt;/a&gt;&lt;br&gt;&lt;/br&gt;
An article that explains the basic ideas of modulus arithmetic: &lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=1346&amp;amp;part=index&quot;&gt;Modulus Arithmetic and Solution to Dirisibly Yours.&lt;/a&gt;&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>0</keystage4>
  <keystage4plus>1</keystage4plus>
  <title>Purr-fection</title>
  <description>What is the smallest perfect square that ends with the four digits
9009?</description>
  <spec_group>Collections
    <specifier>epsilons</specifier>
  </spec_group>
  <spec_group>Using, Applying and Reasoning about Mathematics
    <specifier>Working systematically</specifier>
  </spec_group>
  <spec_group>Numbers and the Number System
    <specifier>Modulus arithmetic</specifier>
  </spec_group>
  <spec_group>Numbers and the Number System
    <specifier>Place value</specifier>
  </spec_group>
</resource>