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:
13.5
Step-by-step explanation:
213.21/15.8 ---> ((213.21)100)/((15.8)100)
21321/1580 = 13 R 781.
781/1580 = 0.49~~~
We only need to be concerned about the tenth and hundredth place digits.
The decimal tells us that it rounds up from 4, so it's 5.
Thus, the answers 13+0.5, which is 13.5
Answer:
idk, but depending on that juice i bet they are drunker then hail
Step-by-step explanation:
The inverse function is f^-1 (x)= -2+(x/3) dont add the parenethese though, i used the parenethese to show that its x over 3. hope that helped! :D
Answer:
3x2x1=3!
Step-by-step explanation:
using nx(n-1)x_x1=n
3x2x1=3!
hence,3x2x1=3!