Answer:
c
Step-by-step explanation:
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:
It's the first one. (m + n - 1) sqrt p
Step-by-step explanation:
We can combine m sqrt p and n sqrt p, resulting in m + n, and combine - sqrt p to become (m + n - 1)sqrt p
Answer:
4800 dollars
Step-by-step explanation:
4000 multiply 0.2=800
4000+800=4800
Y=-3
-3=-1.5x
you substitiue y value, then you divide both sides by -1.5 and you get 2 for x.
(2,-3)
y=4.5
4.5=-1.5x
you substitute y value, then again you divide both sides by -1.5 and you get 3.
(3,4.5)
y=6
6=-1.5x
same thing for this last one. then once again divide by -1.5 and you get -4.
(-4,6)