If AB = 2x, complete the statements below. 2 + (AD)2 = (2x)2 (AD)2 = x2 – x2 (AD)2 = x2 AD =

Mathematics

2 answers:

elena-s [515]3 years ago

8 0

Answer:

X 4 3 X

Step-by-step explanation:

storchak [24]3 years ago

7 0

Answer:

Step-by-step explanation:

You might be interested in

the speed that a tsunami can travel is modeled by the equation mc025-1.jpg , where s is the speed in kilometers per hour and d i

Flura [38]

The answer is a.0.32 km.

The speed that a tsunami can travel is modeled by the equation is s = 356√d.

It is given:
s = 200 km/h
d = ?

Now, let's substitute s in the equation and find d:
s = 356√d
200 = 356√d
√d = 200 ÷ 356
√d = 0.562

Now, let's square both sides of the equation:
(√d)² = (0.562)²
d = (0.562)² = 0.316 ≈ 0.32

Therefore, the approximate depth (d) of water for a tsunami traveling at 200 kilometers per hour is 0.32 km.

5 0

2 years ago

Read 2 more answers

Every day, a comes to the bus stop at the same time, and boards the first bus that arrives. the arrival of the first bus is an e

mylen [45]

So the waiting time for a bus has density f(t)=λe−λtf(t)=λe−λt, where λλ is the rate. To understand the rate, you know that f(t)dtf(t)dt is a probability, so λλ has units of 1/[t]1/[t]. Thus if your bus arrives rr times per hour, the rate would be λ=rλ=r. Since the expectation of an exponential distribution is 1/λ1/λ, the higher your rate, the quicker you'll see a bus, which makes sense.

So define X=min(B1,B2)X=min(B1,B2), where B1B1 is exponential with rate 33 and B2B2 has rate 44. It's easy to show the minimum of two independent exponentials is another exponential with rate λ1+λ2λ1+λ2. So you want:

P(X>20 minutes)=P(X>1/3)=1−F(1/3),P(X>20 minutes)=P(X>1/3)=1−F(1/3),

where F(t)=1−e−t(λ1+λ2)F(t)=1−e−t(λ1+λ2).

8 0

2 years ago

11 people enter a pie eating contest. how many ways can the prize be awarded to the top 3

True [87]

This is a permutation question because we care about the order.
We can demonstrate this by letting each person be a person in the pie eating contest.

A B C D E F G H I J K

_ _ _

Now, there are 11 ways for the first prize to be won, since there are no restrictions upheld. Let's say A wins the first prize.

B C D E F G H I J K

A _ _

Now, assuming prizes aren't shared, there are only ten people left to win the second prize.
Using this logic, then we can say that nine can win the third prize.

Thus, our answer is 11 · 10 · 9 = 990 ways.

However, this method works for this question.
What happens when the number of places we want gets significantly larger?
That's when we introduce the permutation formula.

We know that 11·10·9·8·7·6·5·4·3·2·1 = 11!, but we don't want 8! of them.
This is the formula for permutation.

$^{11}P_3 = \frac{11!}{(11 - 3)!} = 990$