Concept:Use the inclusion-exclusion principle to count numbers divisible by at least one of 10, 15, or 25, then subtract from total.
Explanation:Total numbers from 1 to 1000:
1000Define sets:
A: numbers divisible by 10,
B: by 15,
C: by 25
n(A)=101000​=100n(B)=151000​=66 (floor division)
n(C)=251000​=40For intersections, find LCM:
LCM(10,15) = 30, so
n(A∩B)=301000​=33LCM(10,25) = 50, so
n(A∩C)=501000​=20LCM(15,25) = 75, so
n(B∩C)=751000​=13LCM(10,15,25) = 150, so
n(A∩B∩C)=1501000​=6Apply inclusion-exclusion:
n(A∪B∪C)=100+66+40−33−20−13+6=146Numbers divisible by at least one: 146
Numbers not divisible by any:
1000−146=854Answer:854 (Option B)