Explores the following classical problem: given any 30 points on a circle, join them in pairs by segments in all possible ways. What is the greatest number of nonoverlapping regions into which the interior of the circle can be separated? Presents strategies for solving this problem. (PK)

Four activity workshops are suggested which might be used for several different purposes. The reproducible worksheets address clock patterns, patterns with tides, extending Pythagoras, and fractions extended. (PK)