a) Let $H$ be the smallest convex set of points in the plane which contains $S . \dagger$ Take 3 points $a, b, c \in S$ which lie on the boundary of $H$. (There must always be at least 3 (but not necessarily 4) such points.)

Since $a$ lies on the boundary of the convex region $H$, we can construct a chord $L$ such that no two points of $H$ lie on opposite sides of $L$. Of the two points where the perpendicular to $L$ at $a$ meets the circle, choose one which is on a side of $L$ not containing any points of $H$ and call this point $A$. Certainly $A$ is closer to $a$ than to any other point on $L$ or on the other side of $L$. Hence $A$ is closer to $a$ than to any other point of $S$. We can find the required points $B$ and $C$ in an analogous way and the proof is complete.

[Note that this argument still holds if all the points of $S$ lie on a line.]

!

(a)

!

(b)

b) Let $P Q R$ be an equilateral triangle inscribed in the circle and let $a, b, c$ be midpoints of the three sides of $\triangle P Q R$. If $r$ is the radius of the circle, then every point on the circle is within $(\sqrt{3} / 2) r$ of one of $a, b$ or $c$. (See figure (b) above.) Now $\sqrt{3} / 2 < 9 / 10$, so if $S$ consists of $a, b, c$ and a cluster of points within $r / 10$ of the centre of the circle, then we cannot select 4 points from $S$ (and corresponding points on the circle) having the desired property.