Five Shapes, One Plane

Strange as it may sound, the power of mathematics rests on its evasion of all unnecessary thought and on its wonderful saving of mental operations. —Ernst Mach, 1838–1916

Some geometric puzzles look deceptively simple. Draw a few curves or straight lines, let them intersect as much as possible, and count the regions they create. However, once we impose a restriction, once we ask for the maximum possible number of regions, things begin to look a bit dizzy.

Here, once again, we meet a Hoeflinian puzzle, but this time it comes straight from the Titan Test, which was supposed to be even harder than the Mega Test. In another post, we solved a very similar puzzle in nature, involving three mutually intersecting rectangles. That problem already showed us that counting regions is not quite as straightforward as it might first appear: maximizing areas requires a special kind of topological thinking, a bit different than what one is accustomed to in a typical geometric problem.

The shapes themselves are almost incidental. What really matters is the structure produced by their intersections: which curves meet, where they meet, how those intersections divide the plane, and which resulting regions satisfy the conditions of the problem.

This is what makes these puzzles so interesting. Our usual geometric instincts tend to focus on lengths, angles, areas, and other quantities that can be measured. Here, however, we are being asked to look at a figure in a rather different way. We have to think about its topological structure—about connectivity, boundaries, intersections, and subdivisions—while still exploiting the geometric freedom available to us and, interestingly enough, we leverage our understanding of the Euclidean axioms all the time. The present problem takes this idea a step further. 

Five Shapes, Countless Possibilities

Three mutually intersecting circles (as illustrated below) can yield a maximum of seven completely bounded areas, counting only areas that are not further subdivided. What is the maximum number of completely bounded areas not further subdivided that can be obtained using three mutually intersecting circles plus two triangles?1

venn diagram
Figure 1. AI-stylized Image

Hint

Reveal Hint

Instead of trying to draw the circles first and then fitting in the triangles, try drawing the triangles first, adding them one by one to observe how the number of regions increases to obtain a concrete geometric construction.

Solution

Reveal solution

We begin with the fact that three circles can yield up to seven completely bounded areas. Then, let us draw the first triangle and see by how much the number of bounded regions/areas increases. To maximize the number of regions, all of the triangles are assumed to be in general position2. A triangle may intersect each circle in up to 66 points (each of its three sides can cross the circle twice, as each side “enters” the circle and “exits” it).

The first triangle, therefore, intersects each of the 33 circles in 66 points; these 3×6=183\times6=18 points divide the triangle into 1818 arcs, i.e., connected paths along its boundary between two consecutive intersection points. Each arc divides one of the regions formed by the given 33 circles in two. Consequently, the number of new bounded regions so far is 7+18=257+18=25. By similar reasoning, the second triangle intersects the 33 circles in 1818 points and the first triangle in 66 points (each side of one triangle “enters” and “exits” another triangle). As a result, the new total number of bounded regions is 25+(18+6)=25+24=4925+(18+6)=25+24=49, the maximum possible number of regions. Such a set of circles and triangles is nonempty, as illustrated below3

circles and triangles intersecting
Figure 2. This diagram was constructed using GeoGebra. For construction details and a better view of the smaller areas, you can use the interactive diagram below to zoom in/out.

We may generalize the preceding argument to an n n number of triangles as follows: Suppose that kk of the triangles have already been drawn in the plane such that they intersect each other in general position and they intersect the three circles also in general position; let us draw the (k+1)th(k+1)^{th} triangle and see by how much it increases the number of bounded regions/areas into which the plane is divided. The (k+1)th(k+1)^{th} triangle intersects each of the kk triangles in 66 points; these 6k6k points divide the boundary of the (k+1)th(k+1)^{th} triangle into 6k6k arcs. Each arcs divides the regions formed by the first kk triangles into two parts. 

Moreover, the (k+1)th(k+1)^{th} triangle intersects the three circles in 1818 points, further dividing this triangle into 1818 additional arcs, each of which divides one of the regions formed by the given 33 circles in two. Hence, the total number of newly added bounded regions is 6k+186k+18. Since we begin with seven regions, the total number of parts after drawing the nthn^{th} triangle is 

7+(6+12+18+...+6(n−1))+(18+18+18+...+18⏟ntimes)7+(6+12+18+…+6(n-1))+(\underbrace{18+18+18+…+18}_{n\:\text{times}})
=7+6(1+2+3+...+n−1)+18n=7+6⋅(n−1)n2+18n=7+6(1+2+3+…+n-1)+18n=7+ 6\cdot\frac{(n-1)n}{2}+18n
=7+3n2−3n+18n=7+3n2+15n=3n2+15n+7=7+3n^{2}-3n+18n=7+3n^{2}+15n=3n^{2}+15n+7

If we substitute 22 for nn, we obtain

3⋅(2)2+15⋅2+7=3⋅4+30+7=12+30+7=493\cdot(2)^{2}+15\cdot2+7=3\cdot4+30+7=12+30+7=49

Which is the same answer. You can check that the formula agrees with the case n=1n=1 as calculated in the first argument. 

Making Wider Connections

Suppose we use only circles instead. What is the maximum number of regions (bounded or unbounded) that circles can form in the plane? Can you discover a general formula and prove that no other arrangement can produce more regions? What would this result tell us about the formation of Venn diagrams?

Notes & References

Technical Notes on the Solution & References
  1. From Hoeflin, R. K. (1990, April). Problem 34 in the Titan Test. Retrieved September 7, from http://miyaguchi.4sigma.org/hoeflin/titan/titan.html ↩︎
  2. That is, if no two of them are tangent, no two sides are parallel or coincident, and none of them lies entirely within or outside another, no three of them are concurrent. In addition, for any set of intersecting triangle and circle, no two figures is tangent or lies entirely within or outside either figure, and no three of figures are concurrent. Finally, every two circle have exactly two poins in common. ↩︎
  3. In principle, such sets of figures always exist. It is possible to draw an infinite number of  nn triangles and three circles with the desired properties. For instance, construct nn intersecting equilateral triangles of the same size by fixing a base triangle (the unrotated triangle), then superimpose n−1n-1 congruent triangles with the base triangle, and successively rotate each of these about their common center (i.e., the center of the base triangle) by increasing non-multiples of 2π3\frac{2\pi}{3}. Finally, draw three circles such that each intersects each triangle in 66 points and meets the others in 22 points, and no two circles intersect at the same point in a given triangle. ↩︎

Leave a Comment

Your email address will not be published. Required fields are marked *