## Algebra and Trigonometry 10th Edition

$225,792,840$
If we want to choose $k$ elements out of $n$ disregarding the order, not allowing repetition, we can do this in $_{n}C_k=\frac{n!}{(n-k)!k!}$ ways. The order doesn't matter here when selecting the people, thus we have to use combinations. We have $32$ people for $12$ spots, thus $_{32}C_{12}=\frac{32!}{(32-12)!12!}=225,792,840$