<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>7137</id>
  <path>/www/nrich/html/content/id/7137/</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;In each of the squares in the grid, one of the letters &lt;span style=&quot;font-style: italic;&quot;&gt;P, Q, R&lt;/span&gt; and &lt;span style=&quot;font-style: italic;&quot;&gt;S&lt;/span&gt; must be entered in such a way that touching squares (whether connected by an edge or just a corner) do not contain the same letter. Some of the letters have alread been entered as shown.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
What are the possibilities for the letter in the shaded square?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;mdo:image alt=&quot;&quot; height=&quot;236&quot; src=&quot;43%202010%20a.PNG&quot; width=&quot;243&quot;&gt;&lt;/mdo:image&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/6571&amp;amp;part=&quot;&gt;here is an NRICH task&lt;/a&gt; which challenges you to use similar mathematical ideas.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&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;It is clear that there is a unique way to complete the top three
rows, as shown (start in the second square of the third row).
Thereafter it is possible to complete the fourth row with &lt;span style=&quot;font-style: italic;&quot;&gt;R&lt;/span&gt; and &lt;span style=&quot;font-style: italic;&quot;&gt;S&lt;/span&gt; alternating and the fifth row
&lt;span style=&quot;font-style: italic;&quot;&gt;QPQPQ&lt;/span&gt;. &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;mdo:image width=&quot;243&quot; height=&quot;236&quot; src=&quot;43%202010%20b.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;/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>0</keystage4>
  <keystage4plus>0</keystage4plus>
  <title>Weekly Problem 43 - 2010</title>
  <description>The squares of this grid contain one of the letters P, Q, R and S. Can you complete this square so that touching squares do not contain the same letter? How many possibilities are there?</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>Working systematically</specifier>
  </spec_group>
</resource>