Alvin completely filled his 21-gallon

Mathematics

2 answers:

maxonik [38]3 years ago

8 0

Answer:

He would have saved 7 cents a gallon.

Step-by-step explanation:

The gas he filled up on costed 2.63 a gallon

The gas across the street costed 2.56 per gallon

He spent 55.23 on gas, if he filled up at the station across the street he would have paid 53.76.

Valentin [98]3 years ago

7 0

Answer:

7 cents per gallon if his tank was completely empty upon filling

Step-by-step explanation:

55.23/21=2.63 per gallon at original gas station

2.63-2.56=.07 per gallon saved

You might be interested in

What is the explicit formula for the arithmetic sequence 4/5, 29/30, 17/15, 13/10?

svetoff [14.1K]

Answer:

The answer is D,

a(n) = 4/5 + 1/6(n- 1)

just took the test :)

Step-by-step explanation:

7 0

3 years ago

Read 2 more answers

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)$

$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.