Permutations
A permutation is a mathematical technique that determines the number of possible arrangements in a set when the order of the arrangements matters.
We have a total of 21 students to choose from. There are four positions to be filled.
The total number of ways to fill the positions out of the 21 students can be calculated by using the permutation formula:
[tex]_nP_r=\frac{n!}{(n-r)!}[/tex]Where n is the total number of elements in the set and r is the number of elements selected. In our case, n=21 and r = 4, thus:
[tex]_{21}P_4=\frac{21!}{(21-4)!}[/tex]Applying the properties of the factorial function:
[tex]\begin{gathered} _{21}P_4=\frac{21!}{(17)!} \\ _{21}P_4=\frac{21\cdot20\cdot19\cdot18\cdot17!}{(17)!} \end{gathered}[/tex]Simplifying:
[tex]\begin{gathered} _{21}P_4=21\cdot20\cdot19\cdot18 \\ _{21}P_4=143,640 \end{gathered}[/tex]There are 143,640 possible ways to choose for the 4 positions