A square room has a side that measures 13.5 feet. What is the area of the

Anvisha [2.4K]

(-4,5),(0,6)

slope = rise/run
tip... you have to crawl (run) before you run (rise) .

you can use the slope formula
$\frac{5 - 6}{ - 4 - 0} = \frac{ - 1}{ - 4} = \frac{1}{4}$
1/4

5 0

3 years ago

Lola walks 4/10 mile to her friends house. then she walks 5/10 mile to the store. how far does she wall in all?

Masteriza [31]

We know that <span>Lola walks 4/10 mile to her friends house. then she walks 5/10 mile to the store.

To solve the problem we have to use addition.

4/10 + 5/10 = 9/10

Lola walks 9/10 miles. </span>

8 0

3 years ago

Read 2 more answers

Which strategy best explains how to solve this problem?

Rufina [12.5K]

This is a geometric sequence because each term is twice the value of the previous term. So this is what would be called the common ratio, which in this case is 2. Any geometric sequence can be expressed as:

a(n)=ar^(n-1), a(n)=nth value, a=initial value, r=common ratio, n=term number

In this case we have r=2 and a=1 so

a(n)=2^(n-1) so on the sixth week he will run:

a(6)=2^5=32

He will run 32 blocks by the end of the sixth week.

Now if you wanted to know the total amount he runs in the six weeks, you need the sum of the terms and the sum of a geometric sequence is:

s(n)=a(1-r^n)/(1-r) where the variables have the same values so

s(n)=(1-2^n)/(1-2)

s(n)=2^n-1 so

s(6)=2^6-1

s(6)=64-1

s(6)=63 blocks

So he would run a total of 63 blocks in the six weeks.

4 0

3 years ago

Read 2 more answers

(-4)(5)+(-3)(-2) whats is it???

Vlada [557]

Answer:

-14

Step-by-step explanation:

(-4)(5)+(-3)(-2)

=-20+6

=-14

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

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

3 years ago