Call a number parents if it is composite but not divisible by 2, 3, or 5. The three smallest guardian numbers are 49, 77, and 91. There are 168 prime numbers less than 1000. How many parent numbers are there less than 1000?
Options.
A) a) 90
B) b) 97
C) c) 100
D) d) 106
E) e) 108
Start with the numbers from 1 - 1000. We have 1000 numbers.   Subtract the primes:     1000 - 168= 
<gadget id="calculator">  1000 - 168</gadget>
<output>832</output>
832   Now, subtract the even numbers, divisible by 2. There are 500 even numbers in the set, but the first, 2 itself, has already been subtracted with the primes. There are 499 non-prime even numbers in the set, including 1000 itself. (1000 itself really shouldn't be included, because are looking for numbers less than 1000, but it gets subtracted in this step anyway, so it doesn't matter.)   832 - 499= 
<gadget id="calculator">832 - 499</gadget>
<output>333</output>
333   Now, numbers divisible by 3. There are 333 factors of three between 1 and 1000, but first of all, one of those is the prime number 3, already subtracted, so exclude that --- 332. Of those, half are even, already counted, so that leaves  332/2= 
<gadget id="calculator"> 332/2</gadget>
<output>166</output>
166 non-prime odd multiples of 3.   333 - 166= 
<gadget id="calculator">333 - 166</gadget>
<output>167</output>
167   Now, multiples of 5. There are 200 multiples of 5 up to 1000. Half are even, divisible by 10, so eliminate them --- 100 odd multiples of 5. Eliminate the prime number 5 itself, already counted --- 99 non-prime multiples of 5. Now, 1/3 of these are divisible by three, already counted, so we 2/3 of this number==&gt; 66. There are 66 non-prime multiples of 5 that are not divisible by 3.   167 - 66= 
<gadget id="calculator">167 - 66</gadget>
<output>101</output>
101   The last number that needs to be subtracted --- not prime, not composite, not a multiple of 2 or 3 or 5, is 1 itself. This is not composite, so it is not a parent.   101 - 1= 
<gadget id="calculator">101 - 1</gadget>
<output>100</output>
100   That leaves 100 parent numbers. OA=(c) 100)
<result>C</result>
Call a number parents if it is composite but not divisible by 2, 3, or 5. The three smallest guardian numbers are 49, 77, and 91. There are 168 prime numbers less than 1000. How many parent numbers are there less than 1000?