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:
4/15
Step-by-step explanation:
Bag A
3 red marbles and 6 blue marbles. = 9 marbles
P(blue) = blue/total =6/9 = 2/3
Bag B
6 green marbles and 4 yellow marbles. = 10 marbles
P(yellow) = yellow/total=4/10 = 2/5
P(blue,yellow) = 2/3 * 2/5 = 4/15
Mark received £ 132
<em><u>Solution:</u></em>
Given that £440 is divided between David, Mark & Henry
Let "d" be the share of david
Let "m" be the share of mark
Let "h" be the share of henry
Total amount is 440
Therefore,
share of david + share of mark + share of henry = 440
d + m + h = 440 ------- eqn 1
<em><u>David gets twice as much as Mark</u></em>
d = 2m ----- eqn 2
<em><u>Mark gets three times as much as Henry</u></em>
m = 3h
------ eqn 3
<em><u>Substitute eqn 2 and eqn 3 in eqn 1</u></em>

Thus Mark received £ 132
542(1+1/4)
542(4/4+1/4)
542(5/4)
677.5