The answer is 42.8
I hope that helps<span />
Answer:
C
Step-by-step explanation:
A P E X
Answer:
5 length
Step-by-step explanation:
The diagram attached shows two equilateral triangles ABC & CDE. Since both squares share one side of the square BDFH of length 10, then their lengths will be 5 each. To obtain the largest square inscribed inside the original square BDFH, it makes sense to draw two other equilateral triangles AGH & EFG at the upper part of BDFH with length equal to 5.
So, the largest square that can be inscribe in the space outside the two equilateral triangles ABC & CDE and within BDFH is the square ACEG.
Answer:
There are 17,418,240 different ways to choose the teams.
Step-by-step explanation:
Arrangements of n elements:
The number of possible arrangements of n elements is given by:

In how many different ways can the teams be chosen so that the number of employees on each project are as follows: 9, 4, 2?
This is:
Arrangement of 9 elements, followed by an arrangement of 4 elements followed by an arrangement of 2 elements. So

There are 17,418,240 different ways to choose the teams.
I think the. answer is 511.2