<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>7152</id>
  <path>/www/nrich/html/content/id/7152/</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;
&lt;p&gt;Peter wishes to write down a list of different positive integers less than or equal to $10$ in such a way that for each pair of adjacent numbers one of the numbers is divisible by the other. &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
What is the length of the longest list that Peter could write down?&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
If you liked this problem, &lt;a href=&quot;http://nrich.maths.org/2661&amp;amp;part=&quot;&gt;here is an NRICH task&lt;/a&gt; which challenges you to use similar mathematical ideas.&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt; &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;br&gt;&lt;/br&gt;
&lt;p&gt;Suppose it is possible to make a list of all ten numbers.&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
The number $7$ must be at one end and must be next to $1$ since $7$ has no other factors or multiples under $10$. Without loss of generality we can assume $7$ is the first number, followed by $1$.&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
The number $5$ only has two possible adjacent numbers, $1$ and $10$. The same is true for $9$ which can only be next to $1$ or $3$. Hence either we must start with $7$, $1$, $5$, $10$ and end with $9$; or we start with $7$, $1$, $9$, $3$ and end in $5$. Either way this means that $1$ cannot be next to any other numbers.&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
The diagram below shows the only possible connections that can be used.&lt;br&gt;&lt;/br&gt;
&lt;mdo:image alt=&quot;&quot; height=&quot;152&quot; src=&quot;2011%206.PNG&quot; width=&quot;434&quot;&gt;&lt;/mdo:image&gt;&lt;br&gt;&lt;/br&gt;
It is clearly impossible to link all ten numbers together without using $2$ twice. To see this imagine the sequence starts $7$, $1$, $5$, $10$, then the only possibility after $10$ is $2$ but the only possibility before $6$ is $2$ which means $2$ has to appear twice. Similarly if the sequence start $7$, $1$, $9$, $3$ we must also use $2$ twice.&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
However, the diagram suggests a possible list of nine numbers: $6$, $3$, $9$, $1$, $5$, $10$, $2$, $4$, $8$.&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
There are many other sequences of nine numbers that follow the rule. Can you find them all?&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;/p&gt;&lt;/mdoxml&gt;</solutionXML>
  <noteXML/>
  <clueXML/>
  <canonXML/>
  <end_user_role>2</end_user_role>
  <difficulty>3</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>1</keystage3>
  <keystage4>1</keystage4>
  <keystage4plus>0</keystage4plus>
  <title>Weekly Problem 5 - 2011</title>
  <description>Weekly Problem 5 - 2011</description>
  <spec_group>Using, Applying and Reasoning about Mathematics
    <specifier>Selecting and using information</specifier>
  </spec_group>
  <spec_group>Using, Applying and Reasoning about Mathematics
    <specifier>Visualising</specifier>
  </spec_group>
  <spec_group>Calculations and Numerical Methods
    <specifier>Multiplication &amp; division</specifier>
  </spec_group>
  <spec_group>Numbers and the Number System
    <specifier>Integers</specifier>
  </spec_group>
  <spec_group>Numbers and the Number System
    <specifier>Factors and multiples</specifier>
  </spec_group>
  <spec_group>Secondary Mapping Document
    <specifier>Factors, multiples and primes</specifier>
  </spec_group>
</resource>