Arrange six points in the plane so as to maximize the number of hexagons that can be formed from the points (a hexagon must have nonintersecting sides).

(A proof of optimality is not required: just try to get the most hexagons.)

Of course, there is always the question about 7 points....

© Copyright 2000 Stan Wagon. Reproduced with permission.

29 February 2000