count the number of integer solution for $a \times b \geq k$
given the conditions
1) $1 \leq a \leq p$
2) $1 \leq b \leq q$
(k, p, and q are constant).
count the number of integer solution for $a \times b \geq k$
given the conditions
1) $1 \leq a \leq p$
2) $1 \leq b \leq q$
(k, p, and q are constant).