Answer: 3 and 1/2
Step-by-step explanation:
had this question on the quiz
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:
2
Step-by-step explanation:
thanks! i will do it too!
Answer:
Y = 4
Step-by-step explanation:
9×4+4=40
7×4+12=40
Answer:
r = -3.2
Step-by-step explanation:
-0.6(r+0.2) = 1.8
Divide by -.6
-0.6/-.6(r+0.2) = 1.8/-.6
r+.2 = -3
Subtract .2 from each side
r+.2-.2 = -3-.2
r = -3.2