<?xml version="1.0" encoding="ISO-8859-1" ?>
  <resource>
  <id>1563</id>
  <path>/www/nrich/html/content/02/02/logo1/</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;/br&gt;
&lt;p&gt;&lt;strong&gt;TO POLY :N&lt;br&gt;&lt;/br&gt;
REPEAT :N [ FD 40 RT 360/:N]&lt;br&gt;&lt;/br&gt;
END&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;It was while experimenting with the procedure above that the three overlapping motifs below were produced. In each case the motif is a regular dodecagon.&lt;/p&gt;
&lt;p&gt;&lt;mdo:image alt=&quot;&quot; src=&quot;logo1.gif&quot;&gt;&lt;/mdo:image&gt;&lt;/p&gt;
&lt;table&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;&lt;mdo:image alt=&quot;&quot; src=&quot;logo2.gif&quot;&gt;&lt;/mdo:image&gt;&lt;/td&gt;
&lt;td&gt; &lt;/td&gt;
&lt;td&gt; &lt;/td&gt;
&lt;td&gt; &lt;/td&gt;
&lt;td&gt;Why not experiment with different values of N?
&lt;p&gt;To what extent will sets of Ngons overlap and produce differing tiling patterns?&lt;/p&gt;
&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;
&lt;div&gt;What happens if N is very large? You might want to make the distance you travel forward smaller to see what happens. If you are struggling, why not look at First Forward into LOGO numbers &lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=4854&amp;amp;part=4854&quot;&gt;4&lt;/a&gt; and &lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=4855&amp;amp;part=4855&quot;&gt;6&lt;/a&gt; and also in &lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=1539&amp;amp;part=1539&quot;&gt;LOGO Challenge 10 - Circles&lt;/a&gt; .&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</indexXML>
  <solutionXML/>
  <noteXML>&lt;mdoxml version=&quot;1.0&quot;&gt;What is the RT 360/:N doing in the procedure?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Try some substitution for different values of N and see how this
helps you to draw different polygons.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Try N = 3. Why isn't the answer 60, which is the size
of the angle of an equilateral triangle?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
N.B. As you walk around any polygon what is the total angle you
will always turn through no matter what the size of the
polygon?&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;span style=&quot;font-style: italic;&quot;&gt;360 degrees - which is the sum of
the external, not the interal angles&lt;/span&gt;.&lt;br&gt;&lt;/br&gt;&lt;/mdoxml&gt;</noteXML>
  <clueXML/>
  <canonXML/>
  <end_user_role>2</end_user_role>
  <difficulty>3</difficulty>
  <keystage1>0</keystage1>
  <keystage2>1</keystage2>
  <keystage3>1</keystage3>
  <keystage4>1</keystage4>
  <keystage4plus>0</keystage4plus>
  <title>LOGO Challenge 9 - Overlapping Polygons</title>
  <description>This LOGO challenge starts by looking at 10-sided polygons then
generalises the findings to any polygon, putting particular
emphasis on external angles</description>
  <spec_group>Information and Communications Technology
    <specifier>Logo</specifier>
  </spec_group>
  <spec_group>2D Geometry, Shape and Space
    <specifier>Regular polygons</specifier>
  </spec_group>
</resource>