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


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


Each of the 2n knights have at most n1 enemies. Prove that the knights can be seated at the table, without any enemies next to them.
So, how do you formally prove this?



