<?xml version="1.0" encoding="ISO-8859-1"?>
<mdoxml version="1.0"><br></br>
Three people cracked this one about the same time, Andaleeb from
Woodhouse Sixth Form College, London, Sue from Madras College, St
Andrews and Alexander from Shevah-Mofet School, Tel Aviv.<br></br>
<br></br>
Here is Alexander's solution.<br></br>
<br></br>
Let's prove that it's possible for any triangle to construct
circles with centres at the vertices so that the circles just
touch. Let $a$, $b$ and $c$ be the sides and $r_1$, $r_2$, $r_3$
the radii of the circles. The only constraints on the radii are:
$r_1&gt; 0$, $r_2&gt; 0$, $r_3&gt; 0$. \begin{eqnarray} \\ r_1 +
r_2 &amp;=&amp; a \\ r_2 + r_3 &amp;=&amp; b \\ r_3 + r_1
&amp;=&amp; c. \end{eqnarray} The solution for this system is:
\begin{eqnarray} \\ r_1 &amp;=&amp; \frac{(a + c - b)}{2} \\ r_2
&amp;=&amp; \frac{(a + b - c)}{2} \\ r_3 &amp;=&amp; \frac{(b + c -
a)}{2} \end{eqnarray} and since the sum of the lengths of any 2
sides in a triangle is bigger than the 3rd side, there are
solutions for any positive $a$, $b$ and $c$.<br></br>
<br></br>
Now consider a convex polygon with $n$ sides: $a_1$, $a_2$,
$a_3$,...$a_n$. Suppose circles can be drawn with centres at the
vertices of the polygon such that the circles just touch each
other. Let $r_1$, $r_2$, $r_3$,... be the radii. Then:
\begin{eqnarray} \\ r_1 + r_2 &amp;=&amp; a_1 \\ r_2 + r_3
&amp;=&amp; a_2 \\ ... \\ r_n + r_1 &amp;=&amp; a_n. \end{eqnarray}
&quot; Let's try to figure out what $r_1$ equals, and all the other
solutions will of course be symmetrical. &quot; \begin{eqnarray} \\ r_1
&amp;=&amp; a_n - r_n = a_n - a_{n-1} + r_{n-1}\\ &amp;=&amp; a_n -
a_{n-1} + a_{n-2} - r_{n-2} = ...\\ &amp;=&amp; a_n - a_{n-1} +
a_{n-2} - ...+(-1)^{n-1}a_1 + (-1)^nr_1. \end{eqnarray} &quot; If $n$ is
even then $r_1 = a_n - a_{n-1} + a_{n-2} - ... - a_1 + r_1$ which
means that the condition for the existence of solutions is: $$a_n -
a_{n-1} + a_{n-2} - ... - a_1 = 0.$$ It also means that if this
condition holds there are an infinite number of solutions and if it
does not hold there are no solutions.<br></br>
<br></br>
If $n$ is odd then what we get is $$r_1 = \frac{1}{2}(a_n - a_{n-1}
+ a_{n-2} - ... + a_1)$$ and $r_1$ is positive when $(a_n - a_{n-1}
+ a_{n-2} - ... + a_1) &gt; 0.$<br></br>
<br></br>
For polygons with an odd number of sides solutions always exist but
'negative' values of $r_i$ occur when, instead of touching
externally, one circle surrounds its 'neighbour' which touches it
internally so the length of the edge is given by the difference of
the radii and not the sum of the radii. <br></br></mdoxml>