StepWorking
01given
We need to find the number of 4-digit integers x such that 1000≤x≤2800 and x is divisible by 3 or by 11.
02goal
Find n(A∪B), where A is the set of multiples of 3 in [1000,2800] and B is the set of multiples of 11 in [1000,2800].
03approach
By PIE, n(A∪B)=n(A)+n(B)−n(A∩B), where A∩B is the set of multiples of lcm(3,11)=33. Note that 2800 is not divisible by 3 or 11, so the interval of 4-digit numbers can be taken as [1000,2800] or [1000,2799]. For any integer k, the number of multiples in [1000,2800] is ⌊2800/k⌋−⌊999/k⌋.
04execute
Compute n(A), the number of multiples of 3 in [1000,2800]:
n(A)=⌊2800/3⌋−⌊999/3⌋=933−333=600.
05execute
Compute n(B), the number of multiples of 11 in [1000,2800]:
n(B)=⌊2800/11⌋−⌊999/11⌋=254−90=164.
06execute
Compute n(A∩B), the number of multiples of 33 in [1000,2800]:
n(A∩B)=⌊2800/33⌋−⌊999/33⌋=84−30=54.
07execute
Apply the Principle of Inclusion-Exclusion:
n(A∪B)=n(A)+n(B)−n(A∩B)=600+164−54=710.
✓verify
Check boundary points: 2800=3×933+1=11×254+6, neither multiple, so using 2800 or 2799 yields identical counts: ⌊2799/3⌋−⌊999/3⌋=933−333=600; ⌊2799/11⌋−⌊999/11⌋=254−90=164; ⌊2799/33⌋−⌊999/33⌋=84−30=54. 600+164−54=710. Correct.