Answer:
1771 possible ways
Step-by-step explanation:
In this case, we need to know first how many candidates are in total:
10 + 3 + 10 = 23 candidates in total.
Now, we need to choose 3 of them to receive an award. In this case, we have several scenarios, but as it's an award we can also assume that the order in which the candidates are chosen do not matter, so, the formula to use is the following:
C = m! / n! (m - n)!
Where m is the total candidates and n, is the number of candidates to be chosen. Replacing this data we have:
C = 23! / 3! (23 - 3)!
C = 2.59x10^22 / 6(2.43x10^18)
C = 1771
So we have 1771 ways of choose the candidates.
One way to solve the system is to <u>substitute</u> a variable.
<u>Explanation:</u>
One approach to solve an equation is by substitution of one variable. Right now, a condition for one factor, at that point substitute that arrangement in the other condition, and explain. All value(s) of the variable(s) that fulfills a condition, disparity, arrangement of conditions, or arrangement of imbalances.
The technique for tackling "by substitution" works by settling one of the conditions (you pick which one) for one of the factors (you pick which one), and afterward stopping this go into the other condition, "subbing" for the picked variable and fathoming for the other. At that point you back-explain for the principal variable.
Answer:
A. 115°
Step-by-step explanation:
180° - 65° = 115°
Length (L): 2w + 3
width (w): w
border (b): 
Area (A) = (L + b) * (w + b) <em>NOTE: This is assuming the width also has a border</em>
= (2w + 3 + ) * (w + )
= 
= 
= 
Answer:
200 √17
Step-by-step explanation:
distance between two points (x,y) and (x',y')
D² = (x' - x)² + (y' - y)²
D² = (500 - (-300))² + (400 - 200)² = 640000 + 40000 = 680000
D = √680000 = √4 x 17 x 10000 = 200 √17
