<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>2344</id>
  <path>/www/nrich/html/content/04/weekly/prob20/</path>
  <resourceTypeID>1</resourceTypeID>
  <last_published>2010-08-07T12:23:31</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;The pattern 123451234512345... is continued to form a 2000 digit number. What is the sum of all 2000 digits?&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/2278&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;The number may be divided up into 400 blocks of '12345'. The sum
of the digits in each block is 15 and there are 400 blocks. Hence
the sum of all 2000 digits is 400 x 15 = 6000.&lt;/p&gt;
&lt;p&gt;Alternatively, the mean of each group of five digits is 3 and so
the mean of the digits making up the number is 3. Therefore the sum
is 2000x3 = 6000.&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;The number may be divided up into 400 blocks of '12345'. The sum
of the digits in each block is 15 and there are 400 blocks. Hence
the sum of all 2000 digits is 400 x 15 = 6000.&lt;/p&gt;
&lt;p&gt;Alternatively, the mean of each group of five digits is 3 and so
the mean of the digits making up the number is 3. Therefore the sum
is 2000x3 = 6000.&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 50 - 2011</title>
  <description>
Weekly Problem 50 - 2011

</description>
</resource>