This solution was submitted by Michael of
St John Payne school. Does anyone have any other ideas?
If we draw lines from a particular vertex to every other,
then the angle separating 2 adjacent vertices is
<span class=ëditorial»(Can you explain this? == Ed.)</span>.
If we label the polygon as shown in the right hand diagram, the angle 416
is going to be two lots of
and therefore
.
This means that we have a general rule:
Angle
when
and
or
and
.
But this will only work for angles where B
isn't between A and C. For angles where B is between A and C we need to go the
long way round the polygon from A to C, or in other words the whole polygon
take away A to C. So we can come up with the rule:
Angle
for any angle where
or
.
E.g. Angle
We can use these rules to show that the angles in any quadrilateral ABCD on
the pegboard must add up to
.
If you rotate the peg board so that A is always at point 1 then ABC and BCD
will obey the second rule and CDA and DAB will obey the first rule.
Therefore
We can also deduce that 2 opposite of the quadrilateral angles will add up to
: For quadrilateral ABCD,
where the pegboard is rotated so that point A is on peg 1,
Angle ABC will obey the first rule and Angle CDA will obey the second rule.
Therefore
= sum of to opposite angles
=
!