The answer is D because, if one of the sides is congruent that means that one side has to mirror the other therefore they can never touch
it’s system of substitutions ?
so try
a = 2
b = 5
Answer:
The coach can do this in 3,003 ways
Step-by-step explanation:
Here, the coach needs to select a team of 5 from a total of 15 players
Mathematically, the number of ways this can be done is simply 15 C5 ways
Generally, if we are to select a number of r items from n items, this can be done in nCr ways = n!/(n-r)!r!
Applying this to the situation on ground, we have;
15C5 = 15!/(15-5)!5! = 15!/10!5! = 3,003 ways
Answer:
36
Step-by-step explanation:
2x3 x 2x3 = 36
Sorry if this didnt help
Been a bit since i’ve done this kind of problem.
X+4=20
X is the number of hours needed to work, while 4 is the hours already there.
