edited by
212 views
0 votes
0 votes

There are $n$ songs segregated into $3$ playlists. Assume that each playlist has at least one song. For all $n$, the number of ways of choosing three songs consisting of one song from each playlist is:

  1. $>\frac{n^3}{27}$
  2. $\underline<\frac{n^3}{27}$
  3. $\begin{pmatrix} n\\3 \end{pmatrix}$
  4. $n^3$
edited by

1 Answer

Answer:

Related questions

4 votes
4 votes
3 answers
2