<h3>
Answer: 680 different combinations</h3>
=======================================================
Explanation:
If order mattered, then we'd have 17*16*15 = 4080 different permutations. Notice how I started with 17 and counted down 1 at a a time until I had 3 slots to fill. We count down by 1 because each time we pick someone, we can't pick them again.
So we have 4080 different ways to pick 3 people if order mattered. But again order doesn't matter. All that counts is the group itself rather than the individual or how they rank. There are 3*2*1 = 6 ways to order any group of three people, which means there are 4080/6 = 680 different combinations possible.
An alternative is to use the nCr formula with n = 17 and r = 3. That formula is
![_n C _r = \frac{n!}{r!*(n-r)!}](https://tex.z-dn.net/?f=_n%20C%20_r%20%3D%20%5Cfrac%7Bn%21%7D%7Br%21%2A%28n-r%29%21%7D)
where the exclamation marks indicate factorials
W=-5 because you distribute at the beginning with the 2 variables and you solve that's equation and you will end up with 6w divided by 30 and that's will give u W=-5
Answer:
yasssasasasas
Step-by-step explanation:
oioiioio
Answer:
False
Step-by-step explanation:
They don't look alike
A) the probability is 1 in 6 (1/6); there are six numbers and only one is 6, therefore 1 in 6
B) the probability is 5 in 6 (5/6); there are 6 numbers and only one is not 6, therefore 5 in 6
C) the probability of rolling a 6 is 1 in 6 and the probability of not rolling a 6 is 5 in 6
D) the probability is again 1 in 6 (1/6); 120 divided by 6 is 20, and 20/120 simplifies to 1/6
thats the best i can do to explain