Problem

Source: Bosnia and Herzegovina TST 2013 problem3

Tags: inequalities, induction, combinatorics proposed, combinatorics



Prove that in the set consisting of \binom{2n}{n} people we can find a group of n+1 people in which everyone knows everyone or noone knows noone.