Three Colleges
Source:
April 8, 2011
combinatoricsmaximum and minimum
Problem Statement
There are three colleges in a town. Each college has students. Any student of any college knows students of the other two colleges. Prove that it is possible to choose a student from each of the three colleges so that all three students would know each other.