MathDB
CNCM Online R2P5

Source:

August 8, 2020
CNCMProblem Discussion

Problem Statement

Consider a regular nn-gon of side length 1. For each of its vertices, a circle of radius one is drawn centered at that vertex. The resulting figure, consisting of the polygon and the nn circles, partitions the plane into f(n)f(n) finite, bounded regions. Find n=325f(n).\sum_{n=3}^{25} f(n).
The first term corresponding to i=3i=3 is shown; each of the various colors corresponds to a distinct region with f(3)=10f(3)=10. Note that the lines corresponding to the polygon are treated no differently than the arcs corresponding to the circles in counting regions.
Proposed by Hari Desikan (HariDesikan)