Answer: Permutation Problem
There are 5040 permutations possible
==================================================
Step-by-step explanation:
Order matters because the positions are different.
(A,B,C,D) is different from (B,A,C,D) because the first means person A is the assistant while the second means person B is the assistant.
We have 10 choices for the first slot, 9 for the second, 8 for the third, and 7 for the fourth. We count down the values because a person cannot be reselected to serve multiple positions simultaneously.
Multiply out those values to get 10*9*8*7 = 5040
There are 5040 permutations possible.
---------------
As an alternative, you can use the nPr permutation formula with n = 10 and r = 4 like so
![_n P_r = (n!)/((n-r)!)\\\\_(10) P_(4) = (10!)/((10-4)!)\\\\_(10) P_(4) = (10!)/(6!)\\\\_(10) P_(4) = (10*9*8*7*6!)/(6!)\\\\_(10) P_(4) = 10*9*8*7 \ \ \text{ ... note how this shows up again}\\\\_(10) P_(4) = 5040\\\\](https://img.qammunity.org/2021/formulas/mathematics/college/rwsw0xlzlk3cai2mucponjwn8okge4kmbf.png)
We get the same answer as before.