A person is bored waiting in line. He draws congruent circles where is a positive integer in the plane, all passing through a fixed point, P. If is the number of regions into which these circles can divide the plane, find the minimum value of (Include the region outside the circles in your count.)
This is a Jinx from another Jinx
You can also like the set Divisible by this year???
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!