Question

HELP!!!

Answer 1

look at your previous posts ... we talked about this before ... .
I have to go ... . ttytm (tomorrow )

Answer 2

If order is not relevant, you want to use the combination function n choose k, written\[\left(\begin{matrix}n \\ k\end{matrix}\right)\]This function is used when you have n items and want to know how many ways you can pick a set of k of them. It is given by:\[\left(\begin{matrix}n \\ k\end{matrix}\right) = n!/(k![n-k]!)\]
If order does matter, you need to take the permutation, written as either nPk or P(n,k). This function is used when you want to know how many different arrangements of k objects can be made from a group of n objects. It is given by:\[P(n,k) = n!/(n-k)!\]
From here you should be able to plug your numbers in and solve.