Question

11.2.45

In a race in which eleven automobiles are entered and there are no ties, in how many ways can the first three finishers come in?

Answer 1

The total number of ways in which three winners can come in is 990 ways.

Explanation:

It is provides that the number of automobiles entering the race is: n = 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

`=11* 10* 9\\=990\ \text{ways}`

Thus, the total number of ways in which three winners can come in is 990 ways.