If a figure is a triangle, then it has three sides.

You would start by figuring out the distance the turtle swims every second by dividing 24 by 16.
24➗16=1.5
From this we can take the numbers from either T: 1, ___, 24, 45 or D: ___, 10, 16, ___ to figure out the blank spaces for the other using multiplication or division. Divide T by 1.5, or multiply D by 1.5 to find the other

T: 1, 15, 24, 45
D: 1.5, 10, 16, 30

6 0

2 years ago

Examine the diagram at right. The smaller triangle (inside of the larger triangle) is similar to larger triangle. How can you so

olchik [2.2K]

As the exercise says, the triangles are similar. So, we can set up proportions between correspondent sides.

In order to solve for x we can set up the proportion between the horizontal and vertical sides:

$28\div 11.2 = 27+x \div x$

Solving this proportion for x implies $x=18$

Now you can solve for m and p using the pythagorean theorem, because both triangles are right:

$m = \sqrt{18^2+11.2^2} =21.2$

Then, we know that the hypothenuse of the big triangle is m+p, so we have

$m+p=\sqrt{(18+27)^2+28^2} = 53$

which implies

$p = 53-p = 53-21.2=31.8$

6 0

2 years ago

In a chess variant, a "lord" can move one space at a time, either upward, or to the right, or diagonally up and to the right. ho

valentina_108 [34]

There are 48639 ways for a lord to move from the bottom left to top right corner of the 8 by 8 chessboard

<h3>Further explanation</h3>

The probability of an event is defined as the possibility of an event occurring against sample space.

$\large { \boxed {P(A) = \frac{\text{Number of Favorable Outcomes to A}}{\text {Total Number of Outcomes}} } }$

<h2>Permutation ( Arrangement )</h2>

Permutation is the number of ways to arrange objects.

$\large {\boxed {^nP_r = \frac{n!}{(n - r)!} } }$

<h2>Combination ( Selection )</h2>

Combination is the number of ways to select objects.

$\large {\boxed {^nC_r = \frac{n!}{r! (n - r)!} } }$

Let us tackle the problem.

This problem is similar to Pascal Triangle.

The Lord can move to the right or up in one way only.

We can put "1" in each box on the bottom and left to represent 1 possible movement.

To get the possibility of movement to another box, we will add the possibility of movement to the left, right, and diagonal squares as shown in Figure 1.

This process is repeated for the next box as shown in Figure 2.

Finally, after this process is repeated until the top right box, we get the results as shown in Figure 3.

There are 48639 ways for a lord to move from the bottom left to top right corner of the 8 by 8 chessboard.

<h3>Learn more</h3>

Different Birthdays : brainly.com/question/7567074
Dependent or Independent Events : brainly.com/question/12029535
Mutually exclusive : brainly.com/question/3464581

<h3>Answer details</h3>

Grade: High School

Subject: Mathematics

Chapter: Probability

Keywords: Probability , Sample , Space , Six , Dice , Die , Binomial , Distribution , Mean , Variance , Standard Deviation

7 0

3 years ago