We are given a combinatorics problem were we need to find in how many ways 4 cupids can be assigned to 18 empty lockers, this is symbolized as:
[tex]C(n,r)[/tex]Where "n" is the number of objects, in this case, 18 empty lockers, and "r" is the number of cupids. the formula to find this number is the following:
[tex]C(n,r)=\frac{n!}{r!(n-r)!}[/tex]Replacing the known values we get:
[tex]C(18,4)=\frac{18!}{4!(18-4)!}[/tex]Simplifying:
[tex]C(18,4)=\frac{18!}{4!(14!)}[/tex]Solving we get:
[tex]C(18,4)=\frac{1\cdot2\cdot3\cdot4\cdot5\cdot6\ldots\ldots18}{(1\cdot2\cdot3\cdot4)(1\cdot2\cdot3\cdot4\ldots.14)}[/tex][tex]C(18,4)=3060[/tex]therefore, there are 3060 ways 4 cupids can be assigned to 18 lockers.