Answer:
3.140
Step-by-step explanation:
Answer:
The total number of ways in which three winners can come in is 990 ways.
Step-by-step explanation:
It is provides that the number of automobiles entering the race is: <em>n</em> = 11.
It is also provided that there were no ties.
There are supposed to be three winners for the race.
- The number of ways the first winner can come in is: 11 ways.
- The number of ways the second winner can come in is: 10 ways.
- The number of ways the third winner can come in is: 9 ways.
Compute the total number of ways in which three winners can come in as follows:
Number of ways in which the first three finishers come in is

Thus, the total number of ways in which three winners can come in is 990 ways.
Answer:
(8,-3) is 11 and (4,-7) is 11
Step-by-step explanation:
for both all you have to do is subtract
EX. 8-(-3) = 11
Answer: 5.1961
Step-by-step explanation: I believe you would use the Pythagorean’s theorem, since it’s a problem about a ramp, always draw pictures for word problems. So you would plug your numbers in the formula and solve. 3 squared plus B squared (that’s what we are trying to find so its a variable) equals 6 squared. Then you square and it becomes 9 + b2= 36, subtract 9 on both sides, b2=27, then square root on both sides to get 5.1961. Hopefully that’s right. :)
7 hours , to find the amount of miles in one hour you do 737 divided by 11. Then you take that (67) and divide it by 469