<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>7037</id>
  <path>/www/nrich/html/content/id/7037/</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/6331&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/6112&amp;amp;part=&quot;&gt;Try this next&lt;/a&gt;
    &lt;/li&gt;
    &lt;li&gt;
      &lt;a href=&quot;https://nrich.maths.org/z/node/6799&quot;&gt;Discuss&lt;/a&gt;
    &lt;/li&gt;
    &lt;li&gt;
      &lt;a href=&quot;http://nrich.maths.org/2589&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/7056&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;
Consider a very big book, UltraRef, which refers in its index to every book which does not refer to itself in its index.&lt;br /&gt;
    &lt;br /&gt;
Does UltraRef refer to itself in its index? Be clear as to your explanation.&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;
Paradoxes are a fascinating feature of more advanced considerations of mathematical logic. For a century mathematicians tried to put mathematics on a totally sure logical foundation before realising that this could never be completely achieved.&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;
Constructing a really clear argument to this problem can be
difficult!&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
Put simply:&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
Suppose that exactly one of the following statements is true:&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
A: Ultra Ref does refer to itself in its index&lt;br&gt;&lt;/br&gt;
B: Ultra-Ref does not refer to itself in its index&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
Look at each in turn:&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
IF (Ultra-Ref does refer to itself in its index) THEN (Ultra-Ref
does not refer to itself in its index)&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
IF (Ultra-Ref does not refer to itself in its index) THEN
(Ultra-Ref does refer to itself in its index)&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
In both cases, our supposition is contradicted and Ultra-Ref is
therefore a logical impossibility.&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/>
  <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;
Constructing a really clear argument to this problem can be
difficult!&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
Put simply:&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
Suppose that exactly one of the following statements is true:&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
A: Ultra Ref does refer to itself in its index&lt;br&gt;&lt;/br&gt;
B: Ultra-Ref does not refer to itself in its index)&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
Look at each in turn:&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
IF (Ultra-Ref does refer to itself in its index) THEN (Ultra-Ref
does not refer to itself in its index)&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
IF (Ultra-Ref does not refer to itself in its index) THEN
(Ultra-Ref does refer to itself in its index)&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
In both cases, our supposition is contradicted and Ultra-Ref is
therefore a logical impossibility.&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 15: Indexing problems</title>
  <description>A weekly challenge: these are shorter problems aimed at Post-16
students or enthusiastic younger students.</description>
  <spec_group>Collections
    <specifier>Weekly Challenge</specifier>
  </spec_group>
</resource>