# A recurrence relation problem involving intersecting circles?

Find a recurrence relation for the number of regions created by 'n' mutually intersecting circles on a piece of paper (no three circles have a common intersecting point).

if you could be a clear a possible with your answer that would be awesome... thanks.

-
And respected Madams? Anyway, do you mean the maximum number of regions? I'm not sure if that can be put into a simple recurrence. –  anon Jul 27 '11 at 9:31
Example 1.1 gives a derivation of formulas $a_n=a_{n-1}+2(n-1)$ and $a_n=n^2-n+2$. (If I understood your question correctly, it is identical to this example.)