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
<span>b – 2a – c
= 9 - 2(-3) - (-6)
= 9 + 6 + 6
= 21
answer
21</span>
Answer:
5
Step-by-step explanation:
keep, change, flip
2/1 (keep) x (change to multiply) 5/2(2/5 flips to 5/2)
2/1 x 5/2
10/2
5
I believe the answer is 5.
200 divided by 25 is 8
40 divided by 8 is 5