Given: S={1,2,3,4}
To find: number of unordered pairs {A,B} of subsets of S
such that A∩B=∅
Unordered pair: {A,B}={B,A}
Disjoint: A∩B=∅
Plan: count ordered pairs first, then remove the order
Each x∈S has exactly 3 choices:
x∈Aorx∈Borx∈/A∪B
4 independent choices⟹3×3×3×3=34
34=81ordered pairs (A,B)
Ordered count counts (A,B) and (B,A) separately
Swap (A,B)↔(B,A) pairs them up
(A,B)=(B,A)⟺A=B
A∩B=∅⟹A=B=∅
Unordered=281−1+1
=280+1=40+1
General: unordered disjoint pairs=23n+1
Check n=1: 23+1=2
∑k=04(k4)24−k=(1+2)4=81
n=4: 234+1=282=41
Answer: 41(option 4)
Key idea: 3 choices per element
then 23n−1+1=23n+1