Let X be a set of subsets of {1,2,3,4} such that no element of X is completely contained in any other element of X: that is, for any two distinct subsets A,B∈X, A⊈B and B⊈A.
What is the maximum possible value of ∣X∣?
(Bonus: generalize to {1,2,…,n}.)
Your answer seems reasonable.
Find out if you're right!