Proof Writing & Problem Solving · Challenge problem

A draft contains the step "$a \mid c$ and $b \mid c$, hence $ab \mid c$." For how many ordered pairs $(a, b)$ of integers with $1 \le a \le 10$ and $1 \le b \le 10$ is this step valid for every integer $c$?