In this item, we are informed that the order of the entries does not matter in determination the number of ways in which the Archie can choose for his party. Because the arrangement or order is not important, this type of problem uses the concept of COMBINATION.
The equation for combination is,
nCr = n!/((n - r)!(r!))
nCr is read as "combination of n taken r".
Substituting the known values to the equation,
15C6 = 15! / ((15 - 6)!(6!))
= 5005
Hence, there are 5005 ways in which Archee can choose the 6 entrees for his party.
Answer:
Step-by-step explanation
if my answer is wrong i'm sorry here is a manual on how to do it if its wrong
i think they are right but just in case
Identify the output values. If each input value leads to only one output value, classify the relationship as a function. If any input value leads to two or more outputs, do not classify the relationship as a function.
1 relation
2 function
3 relation
4 function
i know 4 is right but i don't know about others double check i suggest just in case i think they are right
Answer:
Well..
Step-by-step explanation:
Do 23,882 by 11, then do the answer of that problem divided by 11 and so on
You can solve this by doing 8×8×6 which gives you 384. Since we are finding the volume, you would do length times with times height. Hope this helps :-)
Answer:
since highest degree is 2 the degree of a polynomial is also 2.
since the highest exponent is 2 the leading coefficient is 1.
Step-by-step explanation:
