SOLUTION: Find the number of positive integers less than 601 that are not divisible by 4 or 5 or 6

We have a universal set U of 600 elements (integer numbers from 1 to 600 inclusive).


Of them, 600/4  = 150  elements are divisible by  4  (subset F, from the word Four);

         600/5  = 120  elements are divisible by  5  (subset V, from the word fiVe);

         600/6  = 100  elements are divisible by  6  (subset X, from the word siX).


Of them, we have these in-pair intersections

         600/(4*5)  = 30  elements divisible by 4 and by  5  (intersection (F and V) );

         600/(4*6) =  25  elements divisible by 4 and by  6  (intersection (F and X) );

         600/(5*6)  = 20  elements divisible by 5 and by  6  (intersection (V and X) ).


Of them, we have triple intersection

         600/(3*4*5) = 10  elements divisible by 4, 5 and 6  (intersection (F and V and X) ).



Having it, we can calculate the number of elements in the union of the three subsets (F U V U X).


Use the formula for the number of elements in the union of any 3 subsets (inclusion-exclusion principle)


    n(F U X U N) = n(F) + n(V) + n(X) - n(F and V) - n(F and X) - n(V and X) + n(F and V and X) = 

                 =             substitute the obtained numbers from above                       = 

                 =  150 + 120 + 100  -    30      -     25       -     20     +   10 = 305.       


The rest  600 - 305 = 295  integer numbers from 1 to 600 inclusive are not divisible NEITHER by 4, NOR by 5. NOR by 6.


ANSWER.   There are 295 integer numbers from 1 and 600 (inclusive) that are NOT divisible  NEITHER by 4,  NOR by 5, NOR by 6.