combinations - 5 girls 5 dolls - one constraint

Question

Gordon buys 5 dolls for his five nieces. The gifts include two identical TYPE A dolls, one TYPE B doll, one TYPE C doll and one TYPE D doll. If the youngest niece does not want the type D doll, how many different ways can he give the gifts.

I understand the the total number of ways ignoring the constraint is 60 (5!/2!)

To subtract the number of ways that the youngest niece DOES get the type D doll, I use the following logic.

If there are 5 girls and a total of 60 ways, each girl is present in every single one of the 60 combinations.
So looking at all 60 combinations, each girl is getting each type of doll 15 times (60/4).
Not 12 (60/5) because we have already adjusted for the two identical TYPE A dolls (2!)

So how come the answer is not 60 - 15 = 45 (with the constraint)

Thanks!

liferocks · Answer

if the youngest nice always get doll D, other dols i.e. AABC can be distributed in other four girls is 4!/2!=12

so IMO ans should be 60-12=48

in yours logic 60 is the total number then each girls getting each type of doll is 60/5=12..so ans is 60-12=48
What is OA?

“If you don't know where you are going, any road will get you there.”
Lewis Carroll

nabilqureshi · Answer

liferocks wrote:if the youngest nice always get doll D, other dols i.e. AABC can be distributed in other four girls is 4!/2!=12

so IMO ans should be 60-12=48

in yours logic 60 is the total number then each girls getting each type of doll is 60/5=12..so ans is 60-12=48
What is OA?

If the 60 combinations are comprised of each girl getting one of 4 dolls an equal number of times, then each girl must be getting doll D 15 times.

I divide by 4 because the 60 is (5!/2!), meaning we have already adjusted for the two identical dolls, so there are only 4 unique dolls.

Thanks.

newyork10r · Answer

nabilqureshi wrote:Gordon buys 5 dolls for his five nieces. The gifts include two identical TYPE A dolls, one TYPE B doll, one TYPE C doll and one TYPE D doll. If the youngest niece does not want the type D doll, how many different ways can he give the gifts.

I understand the the total number of ways ignoring the constraint is 60 (5!/2!)

Thanks!

Hi, I'm just now going through this problem and am having a difficult time understanding the very first step: why is it divided by 2!?
Thanks.

GMATGuruNY · Answer

nabilqureshi wrote:Gordon buys 5 dolls for his five nieces. The gifts include two identical TYPE A dolls, one TYPE B doll, one TYPE C doll and one TYPE D doll. If the youngest niece does not want the type D doll, how many different ways can he give the gifts.

I understand the the total number of ways ignoring the constraint is 60 (5!/2!)

To subtract the number of ways that the youngest niece DOES get the type D doll, I use the following logic.

If there are 5 girls and a total of 60 ways, each girl is present in every single one of the 60 combinations.
So looking at all 60 combinations, each girl is getting each type of doll 15 times (60/4).
Not 12 (60/5) because we have already adjusted for the two identical TYPE A dolls (2!)

So how come the answer is not 60 - 15 = 45 (with the constraint)

Thanks!

Number of choices for the youngest niece = 4 (since she can't get the type D doll).

Number of ways to give the remaining 4 dolls = 4!/2! = 12. (We divide by 2! to account for the 2 identical dolls.)

Multiplying, we see that the number of ways to give the dolls = 4*12 = 48.

Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3

Choose how you want to prepare

Get Ready for GMAT Test Day Faster with Live Online Classes

Target Test Prep EA OnDemand

Target Test Prep GMAT OnDemand

combinations - 5 girls 5 dolls - one constraint

Chicago Booth

GMAT Course Reviews

Admissions Consulting Reviews

FREE GMAT PREP RESOURCES

GMAT PREP DEAL TRACKER