A person is bored waiting in line. He draws 1000 (distinct) congruent circles in the plane, all passing through a fixed point, P. What is the **smallest** number of regions into which these circles can split the plane?

(Include the region outside the circles in your count.)

See the original problem posted by Jeff Chen.

×

Problem Loading...

Note Loading...

Set Loading...