Dene the set F as the following: F={(a1,a2,...,a2006):∀i=1,2,...,2006,ai∈{−1,1}}
Prove that there exists a subset of F, called S which satises the following:
∣S∣=2006
and for all (a1,a2,...,a2006)∈F there exists (b1,b2,...,b2006)∈S, such that Σi=12006aibi=0. SetscombinatoricsSumpermutations