Answer:
There are 5,586,853,480 different ways to select the jury.
Step-by-step explanation:
The order is not important.
For example, if we had sets of 2 elements
Tremaine and Tre'davious would be the same set as Tre'davious and Tremaine. So we use the combinations formula.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
![C_{n,x} = \frac{n!}{x!(n-x)!}](https://tex.z-dn.net/?f=C_%7Bn%2Cx%7D%20%3D%20%5Cfrac%7Bn%21%7D%7Bx%21%28n-x%29%21%7D)
In how many different ways can a jury of 12 people be randomly selected from a group of 40 people?
Here we have
.
So
![C_{40,12} = \frac{40!}{12!(28)!} = 5,586,853,480](https://tex.z-dn.net/?f=C_%7B40%2C12%7D%20%3D%20%5Cfrac%7B40%21%7D%7B12%21%2828%29%21%7D%20%3D%205%2C586%2C853%2C480)
There are 5,586,853,480 different ways to select the jury.