What a Proof Is · Superchallenge problem

For how many ordered pairs $(a, b)$ of integers with $1 \le a \le 20$ and $1 \le b \le 20$ is the implication "if $a \mid b^2$, then $a \mid b$" false?