permutatiions

This topic has expert replies
Senior | Next Rank: 100 Posts
Posts: 40
Joined: Fri Nov 27, 2009 7:48 pm
Thanked: 1 times

permutatiions

by rtaha2412 » Mon Jan 03, 2011 4:07 pm
If a choir consists of 5 boys and 6 girls, in how many ways can the singers be arranged in a row, so that all the boys are together? Do not differentiate between arrangements that are obtained by swapping two boys or two girls.

120
30
24
11
7
Source: — Problem Solving |

User avatar
Legendary Member
Posts: 543
Joined: Tue Jun 15, 2010 7:01 pm
Thanked: 147 times
Followed by:3 members

by anshumishra » Mon Jan 03, 2011 4:13 pm
rtaha2412 wrote:If a choir consists of 5 boys and 6 girls, in how many ways can the singers be arranged in a row, so that all the boys are together? Do not differentiate between arrangements that are obtained by swapping two boys or two girls.

120
30
24
11
7
bbbbbgggggg
gbbbbbggggg
ggbbbbbgggg
gggbbbbbggg
ggggbbbbbgg
gggggbbbbbg
ggggggbbbbb

7.
Thanks
Anshu

(Every mistake is a lesson learned )

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 » Mon Jan 03, 2011 4:41 pm
rtaha2412 wrote:If a choir consists of 5 boys and 6 girls, in how many ways can the singers be arranged in a row, so that all the boys are together? Do not differentiate between arrangements that are obtained by swapping two boys or two girls.

120
30
24
11
7
Since the boys have to be together, we can think of them as a single element: B.
Since the 6 girls do not have to be together, we must represent them as separate elements: gggggg.

Thus, we need to count the number of ways to arrange the 7 elements Bgggggg.

The number of ways to arrange 7 elements = 7!.

But since we have 6 of the same element -- the 6 g's -- the number of unique arrangements will be smaller. To account for the repeated element, we need to divide by (number of repetitions)!. Since we have 6 g's, we have to divide by 6!.

Thus, the number of possible arrangements is 7!/6! = 7.

The correct answer is E.
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