Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

12C4 = to select first 4 out of 12 for the first group
8C4 = to select second 4 out of the remaining 8 for the second group
the remaining guys will form a group within themselves.

these three groups are interchangeable. So divide by 3! ways.

12C4*8C4/3! should be right. This is because the first group of 4 that you select could have been part of group A, B or C. Hence, any 4 persons selected could have been "interchanged" into any of A, B or C. _________________

these three groups are interchangeable. So divide by 3! ways.

I'm not sure what u mean by this , coz I'm thinking we are just talking combinations and not arrangement. Could you explain in detail.

smandalika,
Not sure if I can explain clearly, but will try. My answer is:
12C4 x 8C4 - gives you the no of ways we can arrange 12 guys in group A (say Maths group, 4 guys), group B (say science group, 4 guys) and group C (say english group, 4 guys)

12C4 x 8C4 x 3! - gives the number of ways these three groups (Maths, Scinece and English) can be arranged (say, placing these three groups in three cars - green car, blue car and red car)

Actual problem does not differentiate between the three groups. All these are meant for the same purpose and are interchangeable. No group is assigned any specific role or character.
Hence, we have to divide by the number of groups!, since these groups are interchangeable (I visualize these three groups to be just standing in chunks on the same platform).

My notes:
=> No of ways of giving r1 things to one group and r2 things to one group from n objects (n=r1 + r2) = nCr1 = n!/(r1!*r2!)
(When u select r1 out of the group r2 is left behind by itself.)
=> for three groups = (m+n+p)!/(m! x n! x p!)
=> for three equal groiups = (3m)!/(m!)^3
=> for three intechangeable groups = (3m!)/(m!^3 x 3!)

I am sure this wasn't cliear enough, but wanted to write my thoughts; I will request Akamai and Ian to give good theory.

The formula for 3 groups of 4 out of 12 total is simply 12!/(4!4!4!).

There are a lot of ways to derive this but here is one that is a little long, but is easy to understand intuitively.

Think of the problem as 3 sequential tasks. First, we need to get the first group of 4 or 12C4. Next we need to find the next group of 4 from the remainig 3 so that is 8C4. Finally, there is 4C4 ways to choose 4 from 4. Hence, we have:

12!/(4!8!) * 8!/4!4! * 4!/4!0! = 12!/(4!4!4!).

Or you can think of it this way. There are 12 ways to pick the first person, then 11, 10 and 9 ways to pick the next 3. But we don't care about the order so we divide by 4! (i.e., there are 4! ways a specific combination of 4 unique numbers can be combined into ordered sequences, but we don't care about order so we divide out this number). Hence we get 12*11*10*9/4!. There are 8, 7, 6, and 5 ways to choose the next 4 people, and once again we divide by 4! so we have 8*7*6*5/4!. Finally, we have 4*3*2*1 ways choose the next 4, but we once again divide by 4! (makes sense as there is only ONE way you can choose a combination of 4 people from 4 people). Multiply this together, you get 12*11*10*9/4! * 8*7*6*5/4! * 4*3*2*1/4! or 12!/(4!4!4!).

Hope this helps,

AB _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

The formula for 3 groups of 4 out of 12 total is simply 12!/(4!4!4!).

There are a lot of ways to derive this but here is one that is a little long, but is easy to understand intuitively.

Think of the problem as 3 sequential tasks. First, we need to get the first group of 4 or 12C4. Next we need to find the next group of 4 from the remainig 3 so that is 8C4. Finally, there is 4C4 ways to choose 4 from 4. Hence, we have:

12!/(4!8!) * 8!/4!4! * 4!/4!0! = 12!/(4!4!4!).

Or you can think of it this way. There are 12 ways to pick the first person, then 11, 10 and 9 ways to pick the next 3. But we don't care about the order so we divide by 4! (i.e., there are 4! ways a specific combination of 4 unique numbers can be combined into ordered sequences, but we don't care about order so we divide out this number). Hence we get 12*11*10*9/4!. There are 8, 7, 6, and 5 ways to choose the next 4 people, and once again we divide by 4! so we have 8*7*6*5/4!. Finally, we have 4*3*2*1 ways choose the next 4, but we once again divide by 4! (makes sense as there is only ONE way you can choose a combination of 4 people from 4 people). Multiply this together, you get 12*11*10*9/4! * 8*7*6*5/4! * 4*3*2*1/4! or 12!/(4!4!4!).

Hope this helps,

AB

You have missed one 3! in this.

12!/(4!4!4!3!) -is the answer. I am not clear on that 3!.

The general formula for the number of ways in which (m+n+p) things can be divided in to 3 groups containing m,n,p things =
(m+n+p)! / (m! * n! * p!)
In this case, m = n =p (as the teams have equal number of students i.e 4)
Hence, the Total number of ways (considering the order also) =
(4+4+4)! / [4! * 4! * 4!]

Since there are 3! such orders (as the number of teams is 3).
As all these orders should not be counted as different (according to problem definition), we are required to divide by 3!.

The general formula for the number of ways in which (m+n+p) things can be divided in to 3 groups containing m,n,p things = (m+n+p)! / (m! * n! * p!) In this case, m = n =p (as the teams have equal number of students i.e 4) Hence, the Total number of ways (considering the order also) = (4+4+4)! / [4! * 4! * 4!]

Since there are 3! such orders (as the number of teams is 3). As all these orders should not be counted as different (according to problem definition), we are required to divide by 3!.

The three teams are designatedA, B, and C. Hence, you do NOT divide by 3! _________________

Best,

AkamaiBrah Former Senior Instructor, Manhattan GMAT and VeritasPrep Vice President, Midtown NYC Investment Bank, Structured Finance IT MFE, Haas School of Business, UC Berkeley, Class of 2005 MBA, Anderson School of Management, UCLA, Class of 1993

Akamai, When would the groups be considered as interchangeable? (like dividing 12 apples equally among three baskets - should the 3! apply in this case).
Thanks.

The general formula for the number of ways in which (m+n+p) things can be divided in to 3 groups containing m,n,p things = (m+n+p)! / (m! * n! * p!) In this case, m = n =p (as the teams have equal number of students i.e 4) Hence, the Total number of ways (considering the order also) = (4+4+4)! / [4! * 4! * 4!]

Since there are 3! such orders (as the number of teams is 3). As all these orders should not be counted as different (according to problem definition), we are required to divide by 3!.

The three teams are designatedA, B, and C. Hence, you do NOT divide by 3!

I agree completely. For anyone who's read any of my posts, you know I don't like using the combinations jargon (it doesn't help anyone who reads this and doesn't know what it's about!). But I do see this as a combinations question within the teams, just not across all three teams. So my paper looks like this:

AB already explained this perfectly in the second part of his first posting, so I won't go into detail about it. If anyone has questions, let me know.

The general formula for the number of ways in which (m+n+p) things can be divided in to 3 groups containing m,n,p things = (m+n+p)! / (m! * n! * p!) In this case, m = n =p (as the teams have equal number of students i.e 4) Hence, the Total number of ways (considering the order also) = (4+4+4)! / [4! * 4! * 4!]

Since there are 3! such orders (as the number of teams is 3). As all these orders should not be counted as different (according to problem definition), we are required to divide by 3!.