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.
Constant because of the fact that it has a zero slope, so it will never decrease nor decrease.
Your answer is B. 2
This is because to rationalise the denominator, we need to multiply it by (3 - √7), so we get:
(3 + √7)(3 - √7)
3 × 3 = 9
3 × √7 = 3√7
3 × -√7 = -3√7
√7 × -√7 = -7
So all in all you get 9 - 7 which is 2.
I hope this helps!
