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 » alt.algebra.help.independent

Topic: Prove that 2n knights can be seated at the round table?
Replies: 1   Last Post: May 5, 2009 4:24 PM

Advanced Search

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

Posts: 1
From: sweden
Registered: 1/19/09
Prove that 2n knights can be seated at the round table?
Posted: Jan 19, 2009 4:40 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Each of the 2n knights have at most n-1 enemies. Prove that the knights can be seated at the table, without any enemies next to them.

So, how do you formally prove this?



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.