Proof Writing & Problem Solving · Superchallenge problem

For how many ordered pairs $(A, B)$ of subsets of $\{1, 2, 3, 4, 5, 6\}$ (either may be empty) is the statement "for every $a \in A$ there is a $b \in B$ with $b \ge 2a$" true?