<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

where the exclamation marks indicate factorials
Answer:
The correct answer is C
Step-by-step explanation:
Answer:
Step-by-step explanation:
first the parenthesis
3^4/3^0=3^4
anything raised to the power of 0 is 1
(3^4)^2=3^8 you multiply the powers
3^-6 * 3^8= 3^(-6+8)=3^2
Answer:
x-intercepts: (2,0), (4,0)
y-intercepts: (0,-8)
Explanation:
To find the x intercept(s), you must compute where y=0. So solve 0= -x^2 + 6x - 8. So, the x intercepts are: (2,0) and (4,0) since the solutions to the mentioned equation are x=2 and x=4. To find the y intercept(s) compute what is y when x=0. In this case, when x=0, y=-8. So the only y intercept is (0,-8).
Answer:
50cm
<em>Nxuwhsiiwhiw8hewheuheuejeur</em>