Answer:
-6
Step-by-step explanation:
Some nasty order of operations coming up.
Firstly, deal with that squared:
-12 / 3 * (-8 + 16 - 6) + 2
Simplify the bracket:
-12 / 3 * 2 + 2
Simplify -12 / 3:
-4 * 2 + 2
Simplify -4 * 2:
-8 + 2
Simplify:
-6
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:
-40
Step-by-step explanation:
12 - 52 = -40
hope this helps...
Answer:
Expected time is 15 hours for him to get to safety.
Step-by-step explanation:
We define X as the time that this miner would get to safety.
We define Y as the door he chooses initially.
P(Y= 1) = P(Y=2)=P(Y=3) = 1/3
We have E[X|Y=1] = 3
E[X|Y] = 5 hours + E[X}
E[X|Y] = 7 hours + E[X]
Then we have
E[X] = 1/3(3 + 5 + E[X] + 7 + E[X])
We cross multiply
3*E[X] = (15 + 2E[x])
3E[X] - 2E[X] = 15
E[X] = 15
So the time it would take to get him to safety is 15 hours
We know that
[the area of a circle]=pi*r²
for r=4 ft
[the area of a circle]=pi*4²------> 50.24 ft²
if 2π radians ( full circle) has an area of-----------------> 50.24 ft²
5π/2 radians--------------------------------------> X ft ²
X=(5π/2)*50.24/2π-------> 62.8 ft²
the answer is
62.8 ft²