Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Re: help
Posted:
Jan 27, 1999 1:37 PM


For people who have not advanced to the point where they want to use induction (and I'd guess this class might not be up to that), it might be worth pointing out that you don't need to find _all_ possible arangements where n circles all intersect each other twice; and you don't even need to now how to go from n to n+1; you just need to find one arrangement, which could have all the circles the same size, and be as symmetric as possible. If you're still having trouble doing it, try for 4 circles, then 5, and even 6. Hopefully that is enough to gain some understanding of the problem.



