This is a simple problem based on combinatorics which can be easily tackled by using inclusion-exclusion principle.
We are asked to find number of positive integers less than 1,000,000 that are not divisible by 6 or 4.
let n be the number of positive integers.
∴ 1≤n≤999,999
Let c₁ be the set of numbers divisible by 6 and c₂ be the set of numbers divisible by 4.
Let N(c₁) be the number of elements in set c₁ and N(c₂) be the number of elements in set c₂.
∴N(c₁) =

N(c₂) =

∴N(c₁c₂) =

∴ Number of positive integers that are not divisible by 4 or 6,
N(c₁`c₂`) = 999,999 - (166666+250000) + 41667 = 625000
Therefore, 625000 integers are not divisible by 6 or 4
I believe the answer to your question is the first choice.
Since we have two sides that are 24 mm that means that the equation needs to have 2(24 mm).
And since we have 4 sides that are 18 mm, it means that the equation needs to have 4(18 mm).
so we get: P= 4(18 mm) + 2(24 mm)
Hope this helped and plz mark as brainliest!
<span>its C. Alan has 13 CDs, Tom has 16 CDs, Barbara has 23 CDs !</span>
Answer: Choice D
Explanation:
The range is the set of all possible y outputs of a function. The highest y can go is y = 1, which occurs at the vertex. We can have y = 1 or y be smaller than this. Therefore, the range is 
Answer:
B. It is the quotient of 19 divided by 100
Step-by-step explanation:
A rational number is the quotient of two integers. 19/100 is the quotient of the integers 19 and 100.