A pool company is creating a blueprint for a family pool and a similar dog pool for a new client. Which statement explains how t
he company can determine whether pool LMNO is similar to pool PQRS?
Translate PQRS so that point P of PQRS lies on point L of LMNO, then dilate PQRS by the ratio segment LM over segment PQ.
Translate PQRS so that point Q of PQRS lies on point M of LMNO, then dilate PQRS by the ratio segment PQ over segment LM.
Translate PQRS so that point P of PQRS lies on point L of LMNO, then translate PQRS so that point Q of PQRS lies on point M of LMNO.
Translate PQRS so that point Q of PQRS lies on point M of LMNO, then translate PQRS so that point P of PQRS lies on point L of LMNO.
Translate PQRS so that point P of PQRS lies on point L of LMNO, then dilate PQRS by the ratio segment LM over segment PQ.
Translate PQRS so that point Q of PQRS lies on point M of LMNO, then dilate PQRS by the ratio segment PQ over segment LM.
Translate PQRS so that point P of PQRS lies on point L of LMNO, then translate PQRS so that point Q of PQRS lies on point M of LMNO.
Translate PQRS so that point Q of PQRS lies on point M of LMNO, then translate PQRS so that point P of PQRS lies on point L of LMNO.
1 answer:
You might be interested in
Answer:
<h2>There are 3,921,225 ways to select the winners.</h2>Step-by-step explanation:
This problem is about combinations with no repetitions, because the same person can't win four times. It's a combinaction because the order of winning doesn't really matter.
Combinations without repetitions are defined as
Where and
.
Replacing values, we have
Therefore, there are 3,921,225 ways to select the winners.
Additionally, as you can imagine, the probability of winning is extremely low, it would be 3,921,225 to 1.