All categories

2 years ago

PLEASEEEEEE IM BEGGING SOMEONE PLEASEEEEEEEE PLEAASEEEEEEEE PLEASEEEEEEEE I NEED HELPPPPP

Mathematics

1 answer:

iVinArrow [24]2 years ago

7 0

Answer: A. SAS

If we look at how the triangles are congruent, we have a side, an included angle, and another side. Therefore, these triangles are congruent by Side-Angle-Side. So we can say that MO is congruent to PR because the triangles are congruent by SAS.

Hope this helps!! :)

You might be interested in

Imagine slicing the pyramid with a plane parallel to its base and passing through the topmost point of the pyramid. What will th

Nitella [24]

Answer:

Cross sections perpendicular to the base and through the vertex will be triangles. Below, you can see a plane cutting through the pyramid, part of the pyramid removed, and the cross section. You could also take a slice parallel to the base. Cross sections parallel to the base will be hexagons.

Step-by-step explanation:

6 0

3 years ago

the smallest known bacteria are from a genus mycoplasma and can measure as small as 300 nanometers in diameter. given that 1 met

vesna_86 [32]

Length of 1 = 300 = 3 *10^2 nanometers
= 3*10^2/1*10^9 m
= 3*10^(2-9)
= 3*10^-7m

3 0

3 years ago

Read 2 more answers

Travelers who fail to cancel their hotel reservations when they have no intention of showing up are commonly referred to as no-s

notsponge [240]

Answer:

a) 0.0523 = 5.23% probability that at least two of the four selected will turn to be no-shows.

b) 0 is the most likely value for X.

Step-by-step explanation:

For each traveler who made a reservation, there are only two possible outcomes. Either they show up, or they do not. The probability of a traveler showing up is independent of other travelers. This means that the binomial probability distribution is used to solve this question.

Binomial probability distribution

The binomial probability is the probability of exactly x successes on n repeated trials, and X can only have two outcomes.

$P(X = x) = C_{n,x}.p^{x}.(1-p)^{n-x}$

In which $C_{n,x}$ is the number of different combinations of x objects from a set of n elements, given by the following formula.

$C_{n,x} = \frac{n!}{x!(n-x)!}$

And p is the probability of X happening.

No-show rate of 10%.

This means that $p = 0.1$

Four travelers who have made hotel reservations in this study.

This means that $n = 4$

a) What is the probability that at least two of the four selected will turn to be no-shows?

This is $P(X \geq 2) = P(X = 2) + P(X = 3) + P(X = 4)$

In which

$P(X = x) = C_{n,x}.p^{x}.(1-p)^{n-x}$

$P(X = 2) = C_{4,2}.(0.1)^{2}.(0.9)^{2} = 0.0486$

$P(X = 3) = C_{4,3}.(0.1)^{3}.(0.9)^{1} = 0.0036$

$P(X = 4) = C_{4,4}.(0.1)^{4}.(0.9)^{0} = 0.0001$

$P(X \geq 2) = P(X = 2) + P(X = 3) + P(X = 4) = 0.0486 + 0.0036 + 0.0001 = 0.0523$

0.0523 = 5.23% probability that at least two of the four selected will turn to be no-shows.

b) What is the most likely value for X?

$P(X = x) = C_{n,x}.p^{x}.(1-p)^{n-x}$

$P(X = 0) = C_{4,0}.(0.1)^{0}.(0.9)^{4} = 0.6561$

$P(X = 1) = C_{4,1}.(0.1)^{1}.(0.9)^{3} = 0.2916$

$P(X = 2) = C_{4,2}.(0.1)^{2}.(0.9)^{2} = 0.0486$

$P(X = 3) = C_{4,3}.(0.1)^{3}.(0.9)^{1} = 0.0036$

$P(X = 4) = C_{4,4}.(0.1)^{4}.(0.9)^{0} = 0.0001$

X = 0 has the highest probability, which means that 0 is the most likely value for X.

7 0

2 years ago

The length of a rectangle is 5 m less than twice the width, and the area of the rectangle is 52 m^2. Find the dimensions of the

lys-0071 [83]

length is 8m

Width is 6.5m

<u>Explanation:</u>

Let, width = b

So, length = 2b-5

area = 52 $m^{2}$

We know,

area of rectangle = length X width

So, $52m^{2}$ = $(2b-5) X b$

On solving the above equation, we get

Width, b = 6.5m

length, l = 8m

4 0

2 years ago

Can someone answer this please so I can go to the back page

igomit [66]

Blake has 25 CD's.

25 times 3 = 75
75 + 7 = 82

Joel has 82 CD's.

If Joel has twice as many as Mariella, then divide 82 by 2 and you get 41.

Mariella has 41 CD's.

7 0

3 years ago

PLEASEEEEEE IM BEGGING SOMEONE PLEASEEEEEEEE PLEAASEEEEEEEE PLEASEEEEEEEE I NEED HELPPPPP​

PLEASEEEEEE IM BEGGING SOMEONE PLEASEEEEEEEE PLEAASEEEEEEEE PLEASEEEEEEEE I NEED HELPPPPP