A number belongs to both divisibility sets precisely when it is a multiple of . In an integer interval from to , the count is , where .
Let be the set of two-digit numbers divisible by , and let be the set of two-digit numbers divisible by . How many numbers are in ?
The numbers in must be divisible by both and . Because the two numbers are prime and distinct,
So the question is equivalent to counting the two-digit multiples of .
The relevant multiples are
The next one is , which is no longer a two-digit number. Thus there are numbers.
The interval formula confirms the count for :
Do not count multiples of and multiples of separately and add them. The intersection asks for numbers satisfying both conditions, so the LCM is the single step that combines them.
Screenshot any problem on your screen and get the steps. Chrome on a computer; free.