There are two solutions for this problem. It depends if order matters or not. Since it is not mentioned in the problem, it is safe to assume that order does not matter and that choosing can be done at random. Then, this is a combination problem:
nCr = n!/r!(n-r)!
where n=13 because there are <span>13 qualified candidates</span>, and r=8 because you choose 8 chiefs at a time
nCr = 13!/8!(13-8)! = 1,287 ways
Answer:
1 scarf costs $15.75 (that is one expensive scarf!)
Step-by-step explanation:
$47.25 divided by 3 = $15.75
Hope I helped :)
Please consider Brainliest :)
Answer:
Step-by-step explanation:
So we have the equation:
To figure out the value of n, divide both sides by -15.9. The right will cancel. Thus:
Use a calculator:
So, the answer is 26.
So, yes, you are very correct!
Answer:
t(d(n)) = 12n + 7
Step-by-step explanation:
- t(d) = 3d + 1
- d(n) = 4n + 2
<u>t(d(n)) = t(4n + 2) </u>
Substitute the function d(n) into the function t(d) for the variable d.
t(4n + 2) = 3(4n + 2) + 1
t(d(n)) = 12n + 7