<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>7097</id>
  <path>/www/nrich/html/content/id/7097/</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;ul id=&quot;buttonBar&quot;&gt;
    &lt;li&gt;
      &lt;a href=&quot;http://nrich.maths.org/6426&amp;amp;part=&quot;&gt;Try this next&lt;/a&gt;
    &lt;/li&gt;
    &lt;li&gt;
      &lt;a href=&quot;http://nrich.maths.org/1333&amp;amp;part=&quot;&gt;Read all about it&lt;/a&gt;
    &lt;/li&gt;
    &lt;li&gt;
      &lt;a href=&quot;http://nrich.maths.org/1418&amp;amp;part=&quot;&gt;Warm-up problem&lt;/a&gt;
    &lt;/li&gt;
    &lt;li&gt;
      &lt;a href=&quot;http://nrich.maths.org/7063&amp;amp;part=solution&quot;&gt;Last week's solution&lt;/a&gt;
    &lt;/li&gt;
  &lt;/ul&gt;
  &lt;div&gt;
    &lt;br /&gt;
A particular list of $N$ consecutive integers starts with $1111$ as follows:&lt;br /&gt;
$$1111, 1112, 1113, \dots, 1111 + N-1$$&lt;br /&gt;
The entire list is shifted $D$ places along the number line and the first number then excluded, leaving a list of $N-1$ larger consecutive numbers as follows:&lt;br /&gt;
$$&lt;br /&gt;
1112+D, 1113+D, \dots, 1111 + N -1+ D&lt;br /&gt;
$$&lt;br /&gt;
    &lt;br /&gt;
In each list the sum of the integers is the same.&lt;br /&gt;
    &lt;br /&gt;
What are the possibilities for $N$ and $D$?&lt;br /&gt;
    &lt;br /&gt;
    &lt;br /&gt;
    &lt;span style=&quot;font-style: italic;&quot;&gt;Extension: Maybe you wish to try to create a similar problem to this one?&lt;/span&gt;
    &lt;br /&gt;
  &lt;/div&gt;
  &lt;div class=&quot;framework&quot;&gt;
    &lt;span style=&quot;font-style: italic;&quot;&gt;Did you know ... ?&lt;/span&gt;
    &lt;br /&gt;
    &lt;br /&gt;
Progressions of integers occur remarkably frequently in mathematics in applications from quantum mechanics to number theory and they have many beautiful properties. Even&amp;#160;Carl Gauss, possibly the greatest mathematician of all time, fondly recalled his first encounter with sums of consecutive natural numbers, when he noticed that the sum of the first $100$ whole numbers&amp;#160; equalled $50$
lots of $101$.&lt;/div&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;
This problem is based on the formula for the sum of the first $n$
natural numbers&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
 1+2+\dots + (n-1) + n =\frac{1}{2}n(n+1)&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
We have&lt;br&gt;&lt;/br&gt;
Its easier in a problem like this to introduce some notation. Let's
write $S(n)$ to mean the sum of the first $n$ natural
numbers.&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
Since the two sums are equal we have&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
S(1111+N-1)-S(1110) = S(1111+N -1 +D) - S(1111 + D)&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Let's put the formula into each of these and cancel each factor of
a half.&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
(1110+N)(1111+N)-(1110)(1111)=(1110+N+D)(1111+N+D)-(1111+D)(1112+D)&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Before leaping in we can see that many parts cancel, so we can
put&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
2221N + N^2 = 2221(N+D) + (N+D)^2 - 2223D - D^2- 2222 &lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Collecting things together gives&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
D(N-1) = 1111&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Now for a bit of number theory: $1111 = 11\times 101$. Thus, for
solutions we require&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
D = 11, N=102\quad\mbox{ or } D=101, N=12&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
You can see these two sums in action on this spreadsheet
screenshot&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;mdo:image height=&quot;359&quot; width=&quot;482&quot; src=&quot;sums.png&quot; alt=&quot;&quot;&gt;&lt;/mdo:image&gt;&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;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;/mdoxml&gt;</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;br&gt;&lt;/br&gt;
This problem is based on the formula for the sum of the first $n$
natural numbers&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
 1+2+\dots + (n-1) + n =\frac{1}{2}n(n+1)&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
We have&lt;br&gt;&lt;/br&gt;
Its easier in a problem like this to introduce some notation. Let's
write $S(n)$ to mean the sum of the first $n$ natural
numbers.&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
Since the two sums are equal we have&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
S(1111+N-1)-S(1110) = S(1111+N -1 +D) - S(1111 + D)&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Let's put the formula into each of these and cancel each factor of
a half.&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
(1110+N)(1111+N)-(1110)(1111)=(1110+N+D)(1111+N+D)-(1111+D)(1112+D)&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Before leaping in we can see that many parts cancel, so we can
put&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
2221N + N^2 = 2221(N+D) + (N+D)^2 - 2223D - D^2- 2222 &lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Collecting things together gives&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
D(N-1) = 1111&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
Now for a bit of number theory: $1111 = 11\times 101$. Thus, for
solutions we require&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
D = 11, N=102\quad\mbox{ or } D=101, N=12&lt;br&gt;&lt;/br&gt;
$$&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
You can see these two sums in action on this spreadsheet
screenshot&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;mdo:image height=&quot;359&quot; width=&quot;482&quot; src=&quot;sums.png&quot; alt=&quot;&quot;&gt;&lt;/mdo:image&gt;&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;br&gt;&lt;/br&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>1</keystage4plus>
  <title>Weekly Challenge 6: AP train</title>
  <description>A weekly challenge: these are shorter problems aimed at Post-16
students or enthusiastic younger students.</description>
  <spec_group>Admin
    <specifier>Stage 5 - Core Mapping</specifier>
  </spec_group>
  <spec_group>Stage 5 Core Mapping Document
    <specifier>Sequences and Series AS</specifier>
  </spec_group>
  <spec_group>Secondary Mapping Document
    <specifier>DisplayCabinet</specifier>
  </spec_group>
</resource>