What a Proof Is · Challenge problem

A proof contains the step "$a \mid c$ and $b \mid c$, so $ab \mid c$." For how many pairs $(a, b)$ with $2 \le a < b \le 10$ can some positive integer $c$ make this step fail?