Answer:
<h2>There are 3,921,225 ways to select the winners.</h2>
Step-by-step explanation:
This problem is about combinations with no repetitions, because the same person can't win four times. It's a combinaction because the order of winning doesn't really matter.
Combinations without repetitions are defined as
![C_{n}^{r} =\frac{n!}{r!(n-r)!}](https://tex.z-dn.net/?f=C_%7Bn%7D%5E%7Br%7D%20%20%3D%5Cfrac%7Bn%21%7D%7Br%21%28n-r%29%21%7D)
Where
and
.
Replacing values, we have
![C_{100}^{4} =\frac{100!}{4!(100-4)!}=\frac{100!}{4! 96!}=\frac{100 \times 99 \times 98 \times 97 \times 96!}{4! \times 96!}= \frac{94,109,400}{24}= 3,921,225](https://tex.z-dn.net/?f=C_%7B100%7D%5E%7B4%7D%20%20%3D%5Cfrac%7B100%21%7D%7B4%21%28100-4%29%21%7D%3D%5Cfrac%7B100%21%7D%7B4%21%2096%21%7D%3D%5Cfrac%7B100%20%5Ctimes%2099%20%5Ctimes%2098%20%5Ctimes%2097%20%5Ctimes%2096%21%7D%7B4%21%20%5Ctimes%2096%21%7D%3D%20%20%5Cfrac%7B94%2C109%2C400%7D%7B24%7D%3D%203%2C921%2C225)
Therefore, there are 3,921,225 ways to select the winners.
Additionally, as you can imagine, the probability of winning is extremely low, it would be 3,921,225 to 1.