<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>6401</id>
  <path>/www/nrich/html/content/id/6401/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2011-02-01T00:00:01</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;
Powers of numbers behave in surprising ways.&lt;br&gt;&lt;/br&gt;
Can you find convincing arguments that explain why all the statements below are true?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;div style=&quot;float: left;&quot;&gt;&lt;mdo:image alt=&quot;This power pylon is unlikely to help...&quot; class=&quot;insetimage&quot; height=&quot;365&quot; src=&quot;Pylon.jpg&quot; width=&quot;180&quot;&gt;&lt;/mdo:image&gt;&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
a) $2^{1}, 2^{2}, 2^{3},......, 2^{99}$ are never multiples of $10$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;div&gt;b) $2^{1} + 3^{1}$, $2^{3} + 3^{3}$, $2^{5} + 3^{5}$, ......, $2^{99} + 3^{99}$ are all multiples of $5$.&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
c) $1^{99} + 2^{99} + 3^{99}$ is even&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
d) $1^{99} + 2^{99} + 3^{99} + 4^{99}$ is a multiple of $5$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
e) $1^{99} + 2^{99} + 3^{99} + 4^{99} + 5^{99}$ is a multiple of $5$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
f) $2^{99} + 3^{99} + 4^{99} + 5^{99} + 6^{99}$ is a multiple of $5$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
g) $3^{99} + 4^{99} + 5^{99} + 6^{99} + 7^{99}$ is a multiple of $5$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
h) $1^{x} + 2^{x} + 3^{x} + 4^{x} + 5^{x}$ is a multiple of $5$ when x is odd.&lt;br&gt;&lt;/br&gt;
&lt;br style=&quot;clear: both;&quot;&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
What other surprising results can you find? Can you explain why they are true?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=6824&amp;amp;part=&quot;&gt;Click here for a poster of this problem&lt;/a&gt;.&lt;br&gt;&lt;/br&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;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-weight: bold;&quot;&gt;An excellent solution to this
problem was sent in by Edward from Carre's Grammar School. Edward
took a sophisticated approach and used modular arithmetic - if you
are not familiar with modular arithmetic&lt;/span&gt; &lt;a style=&quot;font-weight: bold;&quot; href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=4350&quot;&gt;this
article&lt;/a&gt; &lt;span style=&quot;font-weight: bold;&quot;&gt;will help you follow
his reasoning&lt;/span&gt;. &lt;span style=&quot;font-weight: bold;&quot;&gt;Here is an
outline of what he wrote.&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
(a) $2^1,\ldots,2^{99}$ can never be multiples on ten since any
multiple of ten is divisible by $5$, and of course no power of $2$
is divisible by $5$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
(b) Edward provided two solutions to this part.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;text-decoration: underline;&quot;&gt;Method 1&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
We use induction. Clearly $2^1+3^1$ is divisible by $5$. Now for
the induction hypothesis, suppose $2^k+3^k$ is divisible by $5$ for
$k$ odd, i.e. $2^k+3^k=5m$ for some integer $m$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Then $2^{k+2}+3^{k+2}=4\times 2^k+9\times
3^k=4(2^k+3^k)+5(3^k)=4(5m)+5(3^k)=5(4m+3^k)$ and so is divisible
by $5$. This completes the induction step, and we have shown that
$2^k+3^k$ is divisible by $5$ for &lt;span style=&quot;font-weight: bold;&quot;&gt;any&lt;/span&gt; odd $k$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;text-decoration: underline;&quot;&gt;Method 2&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
This method uses modular arithmetic. Edward observed the following
rules:&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
1. If $a\equiv b$ (mod $m$) then $a^n\equiv b^n$ (mod $m$)&lt;br&gt;&lt;/br&gt;
2. If $a\equiv b$ (mod $m$) and $c\equiv d$ (mod $m$) then
$a+c\equiv b+d$ (mod $m$)&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Now $2\equiv 2$ (mod $5$) and $3\equiv -2$ (mod $5$), so for any
odd $k$, $3^k\equiv (-2)^k\equiv -2^k$ (mod $5$) using rule (1),
and therefore $2^k+3^k\equiv 2^k-2^k\equiv 0$ (mod $5$) by rule
(2). In other words, $5$ divides $2^k+3^k$ for any odd $k$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-weight: bold;&quot;&gt;Edward solved the remaining parts
using modular arithmetic.&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
(c) $2^{99}\equiv 0$ (mod $2$), and $1^{99}+3^{99}\equiv 1+1\equiv
0$ (mod $2$) so $1^{99}+2^{99}+3^{99}$ is divisible by $2$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
(d) $2^{99}+3^{99}\equiv 0$ (mod $5$) by part (b). Similarly, since
$4\equiv -1$ (mod $5$), $1^{99}+4^{99}\equiv 1^{99}+(-1)^{99}\equiv
0$ (mod $5$). Therefore $1^{99}+2^{99}+3^{99}+4^{99}$ is divisible
by $5$.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-weight: bold;&quot;&gt;We will leave parts (e)-(h) for
the reader. See if you can use modular arithmetic to prove
them.&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-weight: bold;&quot;&gt;We also received a nice solution
from Yike, who concentrated on the last digits of the numbers and
found various patterns. Can you prove that these patterns hold for
all natural numbers? Why not try using modular
arithmetic?&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</solutionXML>
  <noteXML>&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;h3&gt;Why do this problem?&lt;/h3&gt;

We like to offer students plenty of opportunities to work
mathematically. This problem requires students to analyse patterns,
make some generalisations, pose their own questions and explain
their findings - all key aspects of good mathematical
thinking.&lt;br&gt;&lt;/br&gt;
 

&lt;h3&gt;Possible approach&lt;/h3&gt;

The first few questions are intended to highlight the impact of the
units digits on the product of two or more numbers.&lt;br&gt;&lt;/br&gt;
On the board, write and ask for solutions to&lt;br&gt;&lt;/br&gt;
12 x 23&lt;br&gt;&lt;/br&gt;
42 x 73&lt;br&gt;&lt;/br&gt;
652 x 9883&lt;br&gt;&lt;/br&gt;
17852 x 35703&lt;br&gt;&lt;/br&gt;
&amp;quot;What do all the solutions have in common?&amp;quot;&lt;br&gt;&lt;/br&gt;
&amp;quot;What can you tell me about the product of 543789542 and
56398643?&amp;quot;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Offer the first couple of problems, give students some time to
think about them and then share their convincing arguments. Ensure
that the significance of the units digit is well understood.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Ask them to work on the next five problems and emphasise the need
to provide convincing arguments. This is ideal for a paired
activity.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&amp;quot;We have discovered that powers of numbers do behave in surprising
ways - can you find any other unexpected results?&amp;quot; Ask the students
to contribute to a whole class display of their results and their
proofs.&lt;br&gt;&lt;/br&gt;
&lt;h3&gt;Key questions&lt;/h3&gt;

&lt;div&gt;What patterns can you find in the units digit of ascending
powers of 2, 3, 4...?&lt;/div&gt;

&lt;div&gt;How can you be sure the patterns will continue?&lt;/div&gt;

&lt;br&gt;&lt;/br&gt;
&lt;h3&gt;Possible extension&lt;/h3&gt;

This is an open ended activity which already offers plenty of
opportunities for extension work.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;h3&gt;Possible support&lt;/h3&gt;

You might suggest that students draw up 'power tables' so that the
cyclical nature of the units digits becomes apparent.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</noteXML>
  <clueXML>&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;
What is the impact of the units digits on the product of two or
more numbers?&lt;br&gt;&lt;/br&gt;
e.g. what do you notice about the units digits in all the answers
to the following:&lt;br&gt;&lt;/br&gt;

&lt;div style=&quot;margin-left: 40px;&quot;&gt;2 x 3&lt;/div&gt;
&lt;div style=&quot;margin-left: 40px;&quot;&gt;42 x 53&lt;/div&gt;
&lt;div style=&quot;margin-left: 40px;&quot;&gt;652 x 43&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
What can you say about the patterns of the units digits of powers
of 2, 3, 4, 5...?&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</clueXML>
  <canonXML>&lt;?xml version=&quot;1.0&quot; encoding=&quot;UTF-8&quot;?&gt;
&lt;mdoxml version=&quot;1.0&quot;&gt;&lt;a href=&quot;/content/id/6401/icon.jpg&quot;&gt;fg&lt;/a&gt;h&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</canonXML>
  <end_user_role>2</end_user_role>
  <difficulty>4</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>1</keystage3>
  <keystage4>0</keystage4>
  <keystage4plus>0</keystage4plus>
  <title>Power mad!</title>
  <description>Powers of numbers behave in surprising ways. Take a look at some of
these and try to explain why they are true.</description>
  <spec_group>Numbers and the Number System
    <specifier>Divisibility</specifier>
  </spec_group>
  <spec_group>Numbers and the Number System
    <specifier>Place value</specifier>
  </spec_group>
  <spec_group>Calculations and Numerical Methods
    <specifier>Multiplication &amp; division</specifier>
  </spec_group>
  <spec_group>Numbers and the Number System
    <specifier>Powers &amp; roots</specifier>
  </spec_group>
  <spec_group>Sequences, Functions and Graphs
    <specifier>Sequences</specifier>
  </spec_group>
  <spec_group>Using, Applying and Reasoning about Mathematics
    <specifier>Mathematical reasoning &amp; proof</specifier>
  </spec_group>
  <spec_group>Information and Communications Technology
    <specifier>smartphone</specifier>
  </spec_group>
  <spec_group>Secondary Mapping Document
    <specifier>Factors, multiples and primes</specifier>
  </spec_group>
  <spec_group>Secondary Mapping Document
    <specifier>DisplayCabinet</specifier>
  </spec_group>
</resource>