Find the smallest integer $k \geq 2$ such that for every partition of the set $\{2, 3, \ldots, k\}$ into two parts, at least one of these parts contains (not necessarily distinct) numbers $a$, $b$, and $c$ with $ab = c$.

Let's think step by step and output the final answer within \boxed{}.
user