Permutation Combination Man Guide

This topic has expert replies
Master | Next Rank: 500 Posts
Posts: 184
Joined: Thu Nov 25, 2010 9:57 pm
Thanked: 1 times
Followed by:5 members
GMAT Score:700

Permutation Combination Man Guide

by chaitanya.mehrotra » Fri Jul 29, 2011 4:46 am
Gordon buys 5 dolls for his 5 nieces. The gifts include two identical Sun-and-Fun
beach dolls, one Elegant Eddie dress-up doll, one G.!. Josie army doll, and one Tulip
Troll doll. If the youngest niece does not want the G.!. Josie doll, in how many different
ways can he give the gifts?
Source: — Problem Solving |

User avatar
GMAT Instructor
Posts: 15539
Joined: Tue May 25, 2010 12:04 pm
Location: New York, NY
Thanked: 13060 times
Followed by:1906 members
GMAT Score:790

by GMATGuruNY » Fri Jul 29, 2011 5:09 am
chaitanya.mehrotra wrote:Gordon buys 5 dolls for his 5 nieces. The gifts include two identical Sun-and-Fun
beach dolls, one Elegant Eddie dress-up doll, one G.!. Josie army doll, and one Tulip
Troll doll. If the youngest niece does not want the G.!. Josie doll, in how many different
ways can he give the gifts?
The solution below assumes that every niece is to receive exactly 1 gift.

Good = Total - Bad.

Total:
Number of ways to arrange 5 distinct elements = 5! = 120.
But the 5 elements in the problem above are not distinct; 2 of the gifts are identical, decreasing the number of unique arrangements.
To account for the smaller number of unique arrangements, we must divide by the number of ways to arrange the 2 identical elements:
5!/2! = 60.


Bad:
In a bad arrangement, the youngest niece receives the GI Josie doll.
Since there is only 1 choice for the youngest niece -- in a bad arrangement, she must receive the GI Josie Doll -- we need only count the number of ways to arrange the 4 remaining gifts:
4!/2! = 12.

Good = 60-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

Senior | Next Rank: 100 Posts
Posts: 60
Joined: Sat Jul 16, 2011 11:56 pm
Location: hyderabad
Thanked: 2 times
Followed by:1 members

by naveen451 » Fri Jul 29, 2011 8:44 am
GMATGuruNY wrote:
chaitanya.mehrotra wrote:Gordon buys 5 dolls for his 5 nieces. The gifts include two identical Sun-and-Fun
beach dolls, one Elegant Eddie dress-up doll, one G.!. Josie army doll, and one Tulip
Troll doll. If the youngest niece does not want the G.!. Josie doll, in how many different
ways can he give the gifts?
The solution below assumes that every niece is to receive exactly 1 gift.

Good = Total - Bad.

Total:
Number of ways to arrange 5 distinct elements = 5! = 120.
But the 5 elements in the problem above are not distinct; 2 of the gifts are identical, decreasing the number of unique arrangements.
To account for the smaller number of unique arrangements, we must divide by the number of ways to arrange the 2 identical elements:
5!/2! = 60.


Bad:
In a bad arrangement, the youngest niece receives the GI Josie doll.
Since there is only 1 choice for the youngest niece -- in a bad arrangement, she must receive the GI Josie Doll -- we need only count the number of ways to arrange the 4 remaining gifts:
4!/2! = 12.

Good = 60-12 = 48.

how do u say it is a permutation question. here order is not important.please clarify on this