<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>7379</id>
  <path>/www/nrich/html/content/id/7379/</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 the following exhibits we give an advanced or alternative way of thinking about mathematics concepts which are likely to be known in a more familiar form.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Explore these structures and experiment by substituting particular values such as $0, \pm 1$. Can you work out what they represent?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-weight: bold;&quot;&gt;Exhibit A&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
All pairs of integers such that:&lt;br&gt;&lt;/br&gt;
$$(a, b) + (c, d) = (ad+bc, bd)\quad\quad (Na, Nb) \equiv (a, b) \mbox{ for all } N\neq 0$$&lt;br&gt;&lt;/br&gt;
Can you find two pairs which add up to give $(0, N)$ or $(0, M)$ for various values of $N$, $M$?&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
 &lt;/p&gt;
&lt;div&gt;Next explore the properties of these structures:&lt;/div&gt;
&lt;div&gt; &lt;/div&gt;
&lt;div&gt;&lt;span style=&quot;font-weight: bold;&quot;&gt;Exhibit B&lt;/span&gt;&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
&lt;p&gt;A set of ordered pairs of real numbers which can be added and multiplied such that&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
$(x_1, y_1) + (x_2, y_2) = (x_1 + x_2, y_1 +y_2)$&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
$(x_1, y_1)\times (x_2, y_2) = (x_1x_2 -y_1y_2, x_1y_2+y_1x_2)$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-weight: bold;&quot;&gt;Exhibit C&lt;/span&gt;&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
A set defined recursively such that&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
$+_k(1) = +_1(k)$&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
$+_k(+_1(n)) = +_1(+_k(n))$&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
$\times_k(1) = k$&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
$\times_k(+_1(n)) = +_k(\times_k(n))$&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
In these rules, $k$ and $n$ are allowed to be any natural numbers&lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
 &lt;br&gt;&lt;/br&gt;
Once you have figured out what these structures represent ask yourself this: Are these good representations? What benefits can you see to such a representation? How might familiar properties from the structures be represented in these ways? &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;/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;&lt;strong&gt;Exhibit A&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;The condition $$(Na, Nb) \equiv (a, b) \mbox{ for all } N\neq 0$$ ought to give it away: $$(a,b) \iff \frac{a}{b}$$ This statement simply says that if the numerator and denominator of a fraction share a common factor, they can be cancelled down. &lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Exhibit B&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;If we represent a complex number a+bi by the ordered pair (a,b), we get the required properties:&lt;/p&gt;
&lt;p&gt;$$(a+bi) + (c+di) = (a+c) + (b+d)i \iff (a,b) + (c,d) = (a+c, b+d)$$&lt;/p&gt;
&lt;p&gt;$$(a+bi) \times (c+di) = (ac-bd) + (ad+bc)i \iff (a,b) \times (c,d) = (ac-bd, ad+bc)$$&lt;/p&gt;
&lt;p&gt; &lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Exhibit C&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;These formally define addition and multiplication over the natural numbers. Can you see how the familiar properties we&amp;#39;re used to follow from them?&lt;/p&gt;
&lt;p&gt;The first implies $k+1 = 1+k$, i.e. addition is commutative. &lt;/p&gt;
&lt;p&gt;The second implies $k+(1+n) = 1+(k+n)$, i.e. addition is associative.&lt;/p&gt;
&lt;p&gt;The third implies $k\times 1 = k$, i.e. 1 is the multiplicative identity.&lt;/p&gt;
&lt;p&gt;The fourth implies $k\times(1+n) = k+(k\times n)$, that mulitplication is distributative over addition.&lt;/p&gt;
&lt;p&gt;This is a rigorous treatment of a very familiar concept. For more information on this subject, you could start by reading this &lt;a href=&quot;http://en.wikipedia.org/wiki/Peano_axioms&quot;&gt;Wikipedia article&lt;/a&gt;. &lt;/p&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;h3&gt;Why do this problem&lt;/h3&gt;

This problem gives a taster of abstract representations framed
around familiar mathematical concepts. It is useful to prepare the
way for students to start thinking about abstract mathematics
such as group theory, as concepts such as Identity, Inverse,
Equivalence and Closure will emerge during the task. The latter
parts of the task are good fun to have ongoing over the course of a
week or term.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;h3&gt;Possible approach&lt;/h3&gt;

&lt;div&gt;This problem would be a difficult challenge for keen students
to consider individually, perhaps as an extended homework or
holiday task.&lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;In lesson time it is suited to a group or class discussion
where the problem is gradually solved together -- focus initially
only on exhibit A and the related questions, saving exhibits B and
C for high-fliers or open problems. All students will know the
mathematics for Exhibits A and C, but perhaps skip B (complex
numbers) if students are not in their final year.&lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;Start with Exhibit A and write up the rules. Say something
like &amp;quot;I've got a set containing pairs of integers, such as (1, 22)
and (-34, 8). I have a rule which allows me to combine pairs to
give another pair in my set. &lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;For example $(1, 2) + (2, 3) = (7, 6)$ and $(7, 2) + (3, 5) =
(41, 10)$&lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;Oh, and we also have rules such as $(14, 21) \equiv (2,
3)$&amp;quot;&lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;This is a good place to discuss abstract rules and to
introduce the concept of equivalence if the class has not met this
before.&lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;Allow the class to discuss what might be going on before
writing down the general rule&lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;$(a, b) + (c, d) = (ad+bc, db)$&lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;Suggest that small groups attempt to work out what is
happening by testing out various numerical examples. When a
group feels that they have worked out that the structure is
'addition of fractions' they will then need to convince the rest of
the class of their reasoning. &lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;You can then allow the class to move onto consideration of the
other Exhibits if a longer task is desired.&lt;/div&gt;

&lt;br&gt;&lt;/br&gt;
&lt;h3&gt;Key questions&lt;/h3&gt;

&lt;div&gt;Have you tried exploring with small numbers, both positive and
negative to get a feel for the structure?&lt;/div&gt;

&lt;div&gt;Using our rules, can two pairs be combined to give $(0,
N)$?&lt;/div&gt;

&lt;div&gt;What happens if you combine two of the same pair
together?&lt;/div&gt;

&lt;div&gt;Using our rules, which pairs can be combined to give $(N,
0)?$&lt;/div&gt;

&lt;h3&gt;Possible extension&lt;/h3&gt;

&lt;div&gt;Exhibits B and C are likely to offer sufficient extension. If
more exploration is desired, students can attempt to alter the
combination rules and see if any structures emerge.&lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;div&gt;You could also ask students to devise exhibits of other
structures, such as vectors and matrices.&lt;/div&gt;

&lt;div&gt; &lt;/div&gt;

&lt;h3&gt;Possible support&lt;/h3&gt;

&lt;div&gt;You can greatly simplify this tasks by asking 'This is similar
to addition of fractions! Can anyone see why?' or 'This is addition
of complex numbers' or 'These are the rules of arithmetic'.&lt;/div&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;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;</noteXML>
  <clueXML/>
  <canonXML/>
  <end_user_role>2</end_user_role>
  <difficulty>5</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>0</keystage3>
  <keystage4>0</keystage4>
  <keystage4plus>1</keystage4plus>
  <title>Sheep in wolf's clothing</title>
  <description>Can you work out what simple structures have been dressed up in these advanced mathematical representations?</description>
  <spec_group>Advanced Algebra
    <specifier>Groups</specifier>
  </spec_group>
  <spec_group>Advanced Algebra
    <specifier>Complex numbers</specifier>
  </spec_group>
  <spec_group>Advanced Algebra
    <specifier>Isomorphism</specifier>
  </spec_group>
  <spec_group>Advanced Algebra
    <specifier>Relations</specifier>
  </spec_group>
  <spec_group>Secondary processes
    <specifier>PM - Representing</specifier>
  </spec_group>
</resource>