Thread: How many numbers in the set {1, 2, . . . , 240} are divisible by...

Hey guys. Ive been having trouble with this question. Can someone show me how its done ?

How many numbers in the set {1, 2, . . . , 240} are divisible by (a) at least ONE of the
numbers 6, 8, or 9? (b) precisely TWO of the numbers 6, 8, or 9?

thanks in advance!

Inclusion–exclusion principle

I having trouble understanding that wiki article. How do I use it in my situation ?

this problem is a pretty nice one.

you should investigate what happens with de gcd and lcm first and "think about tiny cases" what if we are interested in {1,2,3,...20}?? make a reasoning there and then think about de whole question.

Let be the sets of integers between 1 and 240 that are divisible by 6, 8, and 9 respectively.

We want to know how many of these integers are divisible by at least one of 6, 8, 9; this is the same as asking how many of these integers are in at least one of the sets I defined above.

Saying something is in at least one of those sets is the same as saying that number is in the union of the sets. So we want to know how many elements there are in the set .

Apply the Inclusion-Exclusion principle to find .