1. ## Easy combination problem

Suppose there are six people and I want to divide them into groups of 3 and 3. How many different ways can this occur (order of the people does not matter).

I know its (6C3 times 3C3)/2!, but I am uncertain why that is over 2!. What general reasoning am I missing.

Thanks.

2. Why are you dividing by "2!"?

3. I don't know! My teacher said it. I thought I understood the concept, but that threw me off...

4. I think you might be confusing the general form of nCr with what you are doing here. Remember that nCr is really just: $\frac{n!}{r!(n-r)!}$, where n!/(n-r)! is the number of ways you can arrange "r" objects out of a total possible "n" objects, and dividing by r! allows us to cancel out all the "duplicates" which are only different arrangements of the same group of objects (this is where the idea of "order doesn't matter" comes from).

In your situation you are told that you have 6 objects, and want to make two groups out of them. Right off the bat you know that the total possible ways you can make these groups will be # of Group A multiplied by # of Group B. Right off the bat, you should recognize that if you are making even groups, no matter what combination of people in Group A will be, there will only ever be one way you can arrange the people into Group B (everyone left over goes into group B).

Total ways of arranging nCr into groups:

Group A - $\frac{6!}{3!(6-3!)}$

Group B - $\frac{3!}{3!(3-3)!}$

Total ways to arrange the two groups:

$(\frac{6!}{3!(6-3!)})(\frac{3!}{3!(3-3)!}) = 20$

The teacher (I hope), knows what they are talking about - however you also need to make sure that you know only understand the material but that you KNOW the material. Or else it's not going to stick. Memorization is cool for social sciences - but here, without truly knowing a bit of material - its just going to slip right out of your brain the first chance it gets.

5. Originally Posted by nankor
Suppose there are six people and I want to divide them into groups of 3 and 3. How many different ways can this occur (order of the people does not matter). I know its (6C3 times 3C3)/2!, but I am uncertain why that is over 2!. What general reasoning am I missing.
You divide by two because this is an unordered partition.
If you divided into a red group and a blue group then that is $\frac{6!}{(3!)^2}$.
That is the member of ways to arrange the string $RRRBBB$.

But in this case we do not have labeled groups, so divide by two $\frac{6!}{2(3!)^2}$.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 7, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://mathhelpforum.com/discrete-math/122541-easy-combination-problem.html", "fetch_time": 1516110963000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2018-05/segments/1516084886436.25/warc/CC-MAIN-20180116125134-20180116145134-00735.warc.gz", "warc_record_offset": 228977349, "warc_record_length": 11776, "token_count": 657, "char_count": 2509, "score": 4.15625, "int_score": 4, "crawl": "CC-MAIN-2018-05", "snapshot_type": "longest", "language": "en", "language_score": 0.9636019468307495, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00056-of-00064.parquet"}