Maths Olympiad Prep

Track / Stage 5 / 392 of 400 #1472 of 2444

Problem 1472

AIME late
Combinatorics Difficulty 6.0 Prove it HMMT February · United States · 2019

Define P={S,T}P=\{\mathrm{S}, \mathrm{T}\} and let P\mathcal{P} be the set of all proper subsets of PP. (A proper subset is a subset that is not the set itself.) How many ordered pairs (S,T)(\mathcal{S}, \mathcal{T}) of proper subsets of P\mathcal{P} are there such that

a) S\mathcal{S} is not a proper subset of T\mathcal{T} and T\mathcal{T} is not a proper subset of S\mathcal{S}; and

b) for any sets SSS \in \mathcal{S} and TTT \in \mathcal{T}, SS is not a proper subset of TT and TT is not a proper subset of SS?

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Solution:

For ease of notation, we let 0=,1={S},2={T}0=\varnothing, 1=\{\mathrm{S}\}, 2=\{\mathrm{T}\}. Then both S\mathcal{S} and T\mathcal{T} are proper subsets of {0,1,2}\{0,1,2\}. We consider the following cases:

Case 1. If S=\mathcal{S}=\varnothing, then S\mathcal{S} is a proper subset of any set except the empty set, so we must have T=\mathcal{T}=\varnothing.

Case 2. If S={0}\mathcal{S}=\{0\}, then T\mathcal{T} cannot be empty, nor can it contain either 1 or 2, so we must have T={0}\mathcal{T}=\{0\}. This also implies that if S\mathcal{S} contains another element, then there would be no choice of T\mathcal{T} because {0}\{0\} would be a proper subset.

Case 3. If S={1}\mathcal{S}=\{1\}, then T\mathcal{T} cannot contain 0, and cannot contain both 1 and 2 (or it becomes a proper superset of S\mathcal{S}), so it can only be {1}\{1\} or {2}\{2\}, and both work. The similar apply when S={2}\mathcal{S}=\{2\}.

Case 4. If S={1,2}\mathcal{S}=\{1,2\}, then since T\mathcal{T} cannot contain 0, it must contain both 1 and 2 (or it becomes a proper subset of S\mathcal{S}), so T={1,2}\mathcal{T}=\{1,2\}.

Hence, all the possibilities are
(S,T)=(,),({0},{0}),({1},{1}),({1},{2}),({2},{1}),({2},{2}),({1,2},{1,2}) (\mathcal{S}, \mathcal{T})=(\varnothing, \varnothing), (\{0\}, \{0\}), (\{1\}, \{1\}), (\{1\}, \{2\}), (\{2\}, \{1\}), (\{2\}, \{2\}), (\{1,2\}, \{1,2\})
for 7 possible pairs in total.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.