Chapter 15, Problem 1T

How many different complete rankings are possible in an election with 7 candidates?

To determine

To calculate:

The number of ways of different ranks possible in an election with 7 candidates.

Answer to Problem 1T

Solution:

The number of ways is $\underset{\_}{5040}$.

Explanation of Solution

Given:

There are 7 candidates who have to be ranked.

Formula Used:

$n!=n(n-1)(n-2)\mathrm{..........1}$

Calculation:

The number of ways of providing ranks can be done $=n!$

Here ‘n’ is the number of candidates that is $7$. So, the number of ways for provide the rank to the candidates are:

$\begin{array}{ccc}\hfill 7!& =& 7\times 6\times 5\times 4\times 3\times 2\times 1\hfill \\ \hfill & =& 5040\hfill \end{array}$

The number of ways is $5040$.