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.
Answer:
85 girls and 140 boys
Step-by-step explanation:
A = P (1 + r/n)^nt
A = 4000(1 + 0.05/1)^(13)(1)
A = $7542.59
Given:
Reese read twice as many pages Saturday than she read Sunday.
She read a total of 78 pages over the weekend.
To find:
The number of pages she read on Sunday.
Solution:
Let x be the number of pages she read on Sunday.
Reese read twice as many pages Saturday than she read Sunday. So, the number of pager she read on Saturday is 2x.
Total number of page she read over the weekend is:


She read a total of 78 pages over the weekend.



Therefore, Reese read 26 pages on Sunday.
Answer:
c
Step-by-step explanation:
you should divide the distance on time
so
33/6=5.5
26/4=6.5
60/8=7.5
17/2=8.5
you can see answer in this order in c