A person is bored waiting in line. He draws \(n\) congruent circles where \(n\) is a positive integer in the plane, all passing through a fixed point, P. If \(2014\) is the number of regions into which these circles can divide the plane, find the minimum value of \(n \) (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???

×

Problem Loading...

Note Loading...

Set Loading...