<?xml version="1.0" encoding="UTF-8" ?>
  <resource>
  <id>6157</id>
  <path>/www/nrich/html/content/id/6157/</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;ul id=&quot;stemLinks&quot;&gt;
&lt;li&gt;&lt;a href=&quot;http://nrich.maths.org/4832&quot;&gt;Warm-up&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&quot;http://nrich.maths.org/604&quot;&gt;Try this next&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&quot;http://nrich.maths.org/6574&quot;&gt;Think higher&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&quot;http://plus.maths.org/content/newton-and-kissing-problem&quot;&gt;Read: mathematics&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&quot;http://plus.maths.org/content/influenza-virus-its-all-packaging&quot;&gt;Read: science&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&quot;http://sciencefair.math.iit.edu/projects/mnmpack/&quot;&gt;Explore further&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;div&gt; &lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
&lt;ul class=&quot;noindent&quot;&gt;&lt;/ul&gt;
&lt;div&gt;How efficiently can you pack disks of the same size with no overlap? Imagine attempting to cover a 1m square with 10cm diameter disks with no overlap. What percentage of the area of the square can you actually cover using this obvious packing for disks?&lt;/div&gt;
&lt;br&gt;&lt;/br&gt;
&lt;p&gt;&lt;mdo:image alt=&quot;disks image&quot; height=&quot;190&quot; src=&quot;disks.JPG&quot; width=&quot;538&quot;&gt;&lt;/mdo:image&gt;&lt;br&gt;&lt;/br&gt;
How much more efficiently would you be able to pack 1cm diameter disks into the 1m square? Could you make an estimate for the efficiency of packing disks of diameter 1mm?&lt;/p&gt;
&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;ul&gt;
&lt;li&gt;As a harder extension, make an estimate of the number of 1cm diameter balls that would be able to fit into a 1m cubed box.&lt;/li&gt;
&lt;/ul&gt;
&lt;ul class=&quot;noindent&quot;&gt;&lt;/ul&gt;
&lt;h6 style=&quot;font-style: normal;&quot;&gt; &lt;/h6&gt;
&lt;br&gt;&lt;/br&gt;
&lt;div class=&quot;framework&quot;&gt;
&lt;h4&gt;Notes and background&lt;/h4&gt;
&lt;p class=&quot;style1&quot;&gt;Whilst it might seem relatively simple, the problem of &amp;#39;shape packing&amp;#39; is often very difficult mathematically to solve with certainty for many shapes. Intuitive visualisation often works just as well as a strict mathematical analysis, and often is the only sensible possibility with packing together complicated shapes.&lt;/p&gt;
&lt;p class=&quot;style1&quot;&gt;You might like to consider situations in which efficient shape packing is relevant in the physical world.&lt;/p&gt;
&lt;/div&gt;
&lt;br&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;
First we need to find how many discs we can stack $1 \ \mathrm{m}$ in the $y$-direction, the centres of all the discs lie on a line at 60 degrees to the horizontal.&lt;br&gt;&lt;/br&gt;
The total number stacked vertically $= \frac{1}{d\sin 60^\circ}$ (where $d$ is the diameter of a disc measured in m)&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Case 1: $d = 10 \ \mathrm{cm} =0.1 \ \mathrm{m}$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$\textrm{Number of discs stacked vertically} = 11 $&lt;br&gt;&lt;/br&gt;
$\textrm{Total number of discs} = (6 \times 10) + (5 \times 9) = 105 $&lt;br&gt;&lt;/br&gt;
$\textrm{Packing fraction} = \frac{\textrm{No. Discs} \times \pi r^2}{1} = 0.825 $&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Case 2: d=1cm = 0.01m&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Number of discs stacked vertically = 115&lt;br&gt;&lt;/br&gt;
Total number of discs = (58x100) + (57x99)= 11443&lt;br&gt;&lt;/br&gt;
Packing fraction =$\frac{No. Discs x \pi r^2}{1}$= 0.899&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Case 3: d = 1mm =0.001m&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Number of discs stacked vertically = 1154&lt;br&gt;&lt;/br&gt;
Total number of discs = (577x1000) + (577x999)= 1153423&lt;br&gt;&lt;/br&gt;
Packing fraction =$\frac{No. Discs x \pi r^2}{1}$= 0.906&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Extension&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
The most efficent method of packing spheres is face centred cubic packing, FCC packing will provide us with an upper limit to the number of spheres we can pack.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
In the Face Centered Cubic (FCC) unit cell there is one host sphere at each corner and one host sphere in each face. Since each corner sphere contributes one eighth of its volume to the cell interior, and each face sphere contributes one half of its volume to the cell interior (and there are six faces), then there are a total of $\frac{1}{8}x8 + \frac{1}{2} x 6 = 4$ spheres in the unit
cell.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
&lt;mdo:image alt=&quot;&quot; height=&quot;191&quot; src=&quot;FCC.jpg&quot; width=&quot;213&quot;&gt;&lt;/mdo:image&gt;&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
If we define&lt;br&gt;&lt;/br&gt;
a = length of one side of the unit cell&lt;br&gt;&lt;/br&gt;
r = radius of one sphere&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
we can see that 4rsin(45) = a.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
The volume fraction of such a unit cell is the number of spheres in the cell multiplied by the volume of a sphere and then divided by volume of cube.&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
Volume fraction = $\frac{4x \frac{4}{3}\pi r^3}{(2\sqrt(2)r)^3}$ = 0.74&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
The number of spheres in a volume of $1m^3$ is therefore:&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
$\frac{0.74}{\frac{4}{3}\pi (0.005)^3}= 1413295$&lt;br&gt;&lt;/br&gt;
&lt;br&gt;&lt;/br&gt;
This is the upper limit to the number of spheres we may pack. It is likely we will not actually be able to pack quite so many. If we did adopt this method we would have fractions of spheres along the sides of the container, as shown in the unit cell above.&lt;br&gt;&lt;/br&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;

&lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=6157&amp;amp;part=&quot;&gt;
This problem&lt;/a&gt; will allow students to engage with calculations of
areas of disks, often used as an approximation to real objects in
science. They will also practice visualisation skills.&lt;br&gt;&lt;/br&gt;
To find the best answer students will need to resort to
trigonometry, although this is not necessary to make a satisfactory
attempt at the question. 

&lt;h3&gt;Possible approach&lt;/h3&gt;

Whilst students might be familiar with the concept of the area of a
disk they might be unable immediately to see how to apply this to
the question in hand. Some discussion might facilitate this. Note
that there are two 'obvious' different ways to pack disks. Which
will work best? Discuss this. When they do the packing calculation,
be sure to note that students must be clear as to exactly how may
rows and columns of disks will fit into the grid. They can do this
exactly (using trigonometry) or by drawing an accurate diagram and
taking a measurement. Or, perhaps, they will produce some other
valid method. 

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

&lt;ul&gt;
&lt;li&gt;Describe your method of packing the disks clearly in
words.&lt;/li&gt;

&lt;li&gt;How many different sensible packing methods might you try?&lt;/li&gt;

&lt;li&gt;Can you be sure that each disk is completely contained within
the confines of the square?&lt;/li&gt;

&lt;li&gt;What order of magnitude checks could you make to test that your
answer is sensible?&lt;/li&gt;
&lt;/ul&gt;

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

Can students repeat the question by filling an equilateral triangle
with side 1m? 

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

&lt;div&gt;Provide coins or counters for the students physically to work
with.&lt;/div&gt;

&lt;br&gt;&lt;/br&gt;
 

&lt;div&gt;Students might struggle with the 'open' nature of the
questions. To begin, they might like to read the &lt;a href=&quot;http://nrich.maths.org/public/viewer.php?obj_id=6300&amp;amp;part=&quot;&gt;
Student Guide to Getting Started with Rich Tasks&lt;/a&gt;&lt;/div&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>3</difficulty>
  <keystage1>0</keystage1>
  <keystage2>0</keystage2>
  <keystage3>0</keystage3>
  <keystage4>1</keystage4>
  <keystage4plus>0</keystage4plus>
  <title>Efficient packing</title>
  <description>How efficiently can you pack together disks?</description>
  <spec_group>Using, Applying and Reasoning about Mathematics
    <specifier>Visualising</specifier>
  </spec_group>
  <spec_group>2D Geometry, Shape and Space
    <specifier>Circles</specifier>
  </spec_group>
  <spec_group>Measures and Mensuration
    <specifier>Area</specifier>
  </spec_group>
  <spec_group>Applications
    <specifier>Maths Supporting SET</specifier>
  </spec_group>
  <spec_group>Admin
    <specifier>Individual</specifier>
  </spec_group>
  <spec_group>STEM mapping
    <specifier>STEM - Design</specifier>
  </spec_group>
  <spec_group>STEM mapping
    <specifier>STEM - Real World</specifier>
  </spec_group>
  <spec_group>STEM mapping
    <specifier>STEM - Properties Of Shapes</specifier>
  </spec_group>
  <spec_group>STEM mapping
    <specifier>STEM - 2d And 3d</specifier>
  </spec_group>
  <spec_group>STEM mapping
    <specifier>STEM - Length-Area-Volume</specifier>
  </spec_group>
  <spec_group>STEM mapping
    <specifier>STEM - Calculation</specifier>
  </spec_group>
  <spec_group>STEM mapping
    <specifier>STEM - Equations And Formulae</specifier>
  </spec_group>
</resource>