Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » geometry.college.independent

Topic: help
Replies: 4   Last Post: Jan 27, 1999 1:59 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Helena Verrill

Posts: 8
Registered: 12/6/04
Re: help
Posted: Jan 27, 1999 1:37 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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.




Date Subject Author
1/27/99
Read help
Matthew Wiseman
1/27/99
Read Re: help
John Conway
1/27/99
Read Re: help
Helena Verrill
1/27/99
Read Re: help
John Conway
1/27/99
Read RE: help
Matt Enlow

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.