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
Answer:

Step-by-step explanation:



- Therfore theta is QI
- Therfore sin theta >0

-9-6+12h+40=22
12h+25=22
12h=-23
h=-23/12
Answer:
B. He added 3.5 and 5 when he should have multiplied them.
Step-by-step explanation:
Let's observe Joe's steps:
- V = lwh
- 204 = 3.5 * (5) * l
Here, * means to multiply, so we're supposed to multiply 3.5 to 5, which would give you the answer 17.5. Unfortunately, look what Joe got: he obtained the value of 8.5, and if we observe, 3.5 + 5 = 8.5.
That's how we know that Joe added instead of multiplied, as he should have done. Thus, the answer is B.