Answer:
y = 12^8
Step-by-step explanation:
Log base 12, y^2 = 16
y2 = 12^16
y = sqrt ( 12^16) = (12^16)^1/2
y = 12^8
I assume it is the last one, 3n^2, because the degree is the exponent, which is two and the three is the coefficient, which is next to the variable, plus it is a monomial, so there is only one term, eliminating the first two, the third one is just reversed. Therefore, the answer should be the last one. Hope this helps. :)
<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
Answer:
look on go ogle or you tube I think there's something on there
2/3 is the answer to this problem.