Problem statement in "Not So Easy Math"

I am unable to get what question is asking to do :frowning:

The problem says that find number of numbers from 1 to n, which have at least one prime divisor less than 20.
Eg n is 25.
Then except 23, all numbers are valid. So rest of the 24 numbers are the answer.