For Sn={1,2,...,n}, find the maximum value of m that makes the following proposition true.Proposition
There exists m different subsets of S, say A1,A2,...,Am, such that for every i,j=1,2,...,m, the set Ai∪Aj is not S. set theoryKJMOcombinatorics