Problems(1)
Let S be a finite set and let P(S) be its power set, i.e., the set of all subsets of S, the empty set and S, inclusive. If A and B are non-empty subsets of P(S), let A∨B={X:X⊆A∪B,A∈A,B∈B}. Given a non-negative integer n⩽∣S∣, determine the minimal size A∨B may have, where A and B are non-empty subsets of P(S) such that ∣A∣+∣B∣>2n.Amer. Math. Monthly combinatoricsSetsromania