Answer: 271
We can solve this using the Principle of Inclusion-Exclusion (PIE).
Let U={1,2,…,500} be the universal set. Let A, B, and C be the subsets of U containing integers divisible by 3, 5, and 7 respectively.
The number of elements in each set is calculated as follows:
- ∣A∣=⌊3500⌋=166
- ∣B∣=⌊5500⌋=100
- ∣C∣=⌊7500⌋=71
Now, we find the pairwise intersections using the least common multiple (LCM) of the divisors:
- ∣A∩B∣=⌊lcm(3,5)500⌋=⌊15500⌋=33
- ∣B∩C∣=⌊lcm(5,7)500⌋=⌊35500⌋=14
- ∣C∩A∣=⌊lcm(7,3)500⌋=⌊21500⌋=23
The intersection of all three sets is:
- ∣A∩B∩C∣=⌊lcm(3,5,7)500⌋=⌊105500⌋=4
Applying the Principle of Inclusion-Exclusion:
∣A∪B∪C∣=(∣A∣+∣B∣+∣C∣)−(∣A∩B∣+∣B∩C∣+∣C∩A∣)+∣A∩B∩C∣∣A∪B∪C∣=(166+100+71)−(33+14+23)+4∣A∪B∪C∣=337−70+4=271