Answer:
Step-by-step explanation:
For each component, there are only two possible outcomes. Either it fails, or it does not. The components are independent. We want to know how many outcomes until r failures. The expected value is given by

In which r is the number of failures we want and p is the probability of a failure.
In this problem, we have that:
r = 1 because we want the first failed unit.
![p = 0.4[\tex]So[tex]E = \frac{r}{p} = \frac{1}{0.4} = 2.5](https://tex.z-dn.net/?f=p%20%3D%200.4%5B%5Ctex%5D%3C%2Fp%3E%3Cp%3ESo%3C%2Fp%3E%3Cp%3E%5Btex%5DE%20%3D%20%5Cfrac%7Br%7D%7Bp%7D%20%3D%20%5Cfrac%7B1%7D%7B0.4%7D%20%3D%202.5)
The expected number of systems inspected until the first failed unit is 2.5
4*10^6 = 4,000,000 1*10^4 = 10,000 4,000,000 x 10,000 = 40,000,000,000 ANSWER: 40,000,000,000
Answer:
A. 6975 cm, B. 69750 mm
Step-by-step explanation:
If (a, b) is on the graph of a function f(x), then (b, a) is on the graph of the inverse.
We have points on the graph of a function: {(-3, 9), (-1, 1), (0, 0), (2, 4)}.
The points on the graph of the inverse: {(9, -3), (1, -1), (0, 0), (4, 2)}.
<h3>Answer: (4, 2), (0, 0), (1, -1).</h3>