Which step will translatef(x)=3^xto g(x)=3^x+1 +4

Memory module consists of 9 chips. The device is designed with redundancy so that it works even if one of its chips is defective

soldier1979 [14.2K]

Answer:

a) $P[C]=p^n$

b) $P[M]=p^{8n}(9-8p^n)$

c) n=62

d) n=138

Step-by-step explanation:

Note: "Each chip contains n transistors"

a) A chip needs all n transistor working to function correctly. If p is the probability that a transistor is working ok, then:

$P[C]=p^n$

b) The memory module works with when even one of the chips is defective. It means it works either if 8 chips or 9 chips are ok. The probability of the chips failing is independent of each other.

We can calculate this as a binomial distribution problem, with n=9 and k≥8:

$P[M]=P[C_9]+P[C_8]\\\\P[M]=\binom{9}{9}P[C]^9(1-P[C])^0+\binom{9}{8}P[C]^8(1-P[C])^1\\\\P[M]=P[C]^9+9P[C]^8(1-P[C])\\\\P[M]=p^{9n}+9p^{8n}(1-p^n)\\\\P[M]=p^{8n}(p^{n}+9(1-p^n))\\\\P[M]=p^{8n}(9-8p^n)$

c)

$P[M]=(0.999)^{8n}(9-8(0.999)^n)=0.9$

This equation was solved graphically and the result is that the maximum number of chips to have a reliability of the memory module equal or bigger than 0.9 is 62 transistors per chip. See picture attached.

d) If the memoty module tolerates 2 defective chips:

$P[M]=P[C_9]+P[C_8]+P[C_7]\\\\P[M]=\binom{9}{9}P[C]^9(1-P[C])^0+\binom{9}{8}P[C]^8(1-P[C])^1+\binom{9}{7}P[C]^7(1-P[C])^2\\\\P[M]=P[C]^9+9P[C]^8(1-P[C])+36P[C]^7(1-P[C])^2\\\\P[M]=p^{9n}+9p^{8n}(1-p^n)+36p^{7n}(1-p^n)^2$

We again calculate numerically and graphically and determine that the maximum number of transistor per chip in this conditions is n=138. See graph attached.

6 0

4 years ago

Twice a number is 24 a. 2- n = 24 b. 2 + n = 24 c. 2 / n = 24 d. 2n = 24

Novosadov [1.4K]

Answer:

the answers are

a)-22

b)22

d)12

8 0

3 years ago

Read 2 more answers

This too!! . Please .

REY [17]

Answer:

In order to tell if these are congruent triangles we would need to know if angles Y and V were congruent, angles X and W are congruent or if segments XU and WU were congruent.

Step-by-step explanation:

Any of these would work because you can use two different methods to telling that these are congruent triangles.

The first method is called side-angle-side. In it you need two side lengths that are congruent with a congruent angle in the middle. Since we already know that the right angle in the middle is congruent, and we know YU and VU are congruent, we would just need to know the additional side to prove congruence.

The second method is called angle, angle side. In this we need to know that two angles in a row are congruent followed by a side. Since we know the middle angle is the same, knowing either other angles would give us this method as well.

8 0

4 years ago

Rosalie bought 4 books that each cost $15.75. she used a coupon for 20% off her purchase and she paid sales tax of 8%. rounded t

lisov135 [29]

Answer:

75$

Step-by-step explanation:

8 0

3 years ago

f is a function such that f(x) < 0. The graph of the new function g defined by g(x) = | f(x) | is a reflection of the graph o

a_sh-v [17]

The graph Would reflect on the x axis

5 0

3 years ago