# Combinations Problem

1. Apr 1, 2008

### TbbZz

1. The problem statement, all variables and given/known data

A group of 12 friends goes to a cinema complex that is showing 6 different movies. If the group splits up into subgroups based on movie preferences, how many subgroup combinations are possible?

2. Relevant equations

nCr
nPr

(we can use calculators)

3. The attempt at a solution

I tried all sorts of ways to solve this problem using nCr and nPr but I couldn't seem to figure it out. I also tried using the equations that involve repetitions, but they didn't seem to help. I also tried simply punching in (relevant) numbers for twenty minutes to help me figure out what functions to use.

The correct answer is 6188, and I was unable to get this answer. I am looking for guidance on answering this problem. Thanks in advance for the help.

2. Apr 1, 2008

### sutupidmath

is a person allowed to whatch more than one movie?

3. Apr 1, 2008

### TbbZz

No, they only watch one movie.

4. Apr 5, 2008

### Shooting Star

If the people are considered identical, then this reduces to the problem of distributing 12 identical objects in six different boxes in all possible ways, where a box may contain 0 to 12 objects, in which case the answer is (6+12-1)C12 = 17C5 =6188.

However, as the problem is given, this answer is incorrect. The correct treatment is a bit more complicated.

Last edited: Apr 5, 2008
5. Apr 5, 2008

### TbbZz

The people are considered identical.

While I understand that 17C12 equals 6188, would you mind clarifying where the numbers came from?

for the notation: nCr , I understand that the "r" equals 12; however, I'm not sure how you determined the (6+12-1) part.

Thanks for the help.

6. Apr 6, 2008

### Shooting Star

This is a standard result, the proof of which is found in any book of combinatorics dealing with problems of moderate level of difficulty. If 'r' identical objects are distributed in 'n' different boxes, then the number of ways of doing it is

$$^{n+r-1}C_{n} = ^{n+r-1}C_{r-1}.$$

I am referring you this, a random source I found in the net. Read pages 102-103. If you still have doubts, you can ask me.

7. Apr 6, 2008

### HallsofIvy

Staff Emeritus
If I understand the problem correctly, that the people can divide into any number of subgroups with each subgroup watching one of the movies, then the problem is quite a bit more complicated.

For example, if they remain in a single group (the only subset is the entire set) then they could watch any one of the six movies: that's 6 possibilities there. Or each could go to a different movie ("singleton" subgroups) and there are 6!ways to do that.

The first question then is: how many ways can you partition of set of 6?

8. Apr 6, 2008

### Shooting Star

Hi HallsofIvy,

I had expressed my misgivings about the method of solving this (post #4), but the OP says that the people are considered to be identical (post #5). In that case, there is no need to consider the number of ways a set of 6 can be partitioned, and the solution is straight forward (post #4).