what u require here is the union of the three sets
well i dont agree wid the answer u provided, coz u can urself crosscheck it if u r asking for atleast div. by one of three then for only div. by two case u will have 500 such numbers in 1-1000.
no req. = no that are div. by (2, 3, 5)-no. divisible by(2&3,3&5,2&5)+no. div by (2&3&5)
Moderation Team
![[Post New]](/templates/default/images/icon_minipost_new.gif){kind=icon}
![[Up]](/templates/default/images/icon_up.gif "[Up]"){kind=icon}
133
