BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

130-point score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions
Start free 5-day trial
Read 559 reviewsTarget Test Prep

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Permutation question

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Newbie | Next Rank: 10 Posts
Posts: 3
Joined: Sun Nov 08, 2009 9:41 pm
by sk02 » Sun Nov 08, 2009 9:59 pm
Hi, could someone provide a more detailed answer for the following permutation question:
Q. How many six-letter sequences consisting of 1A, 2Bs and 3Cs are possible?
The answer guide gave the following:
If all letters in sequence different, 6! sequences possible.
But, arrangement of 2Bs and 3Cs need to be removed, therefore ans = 6! /((2!)(3!))= 60.
I'm having trouble understanding why, to remove the arrangement of 2Bs and 3Cs, the division needs to occur. Thanks. [/url]
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Master | Next Rank: 500 Posts
Posts: 199
Joined: Sat Oct 24, 2009 4:43 pm
Thanked: 22 times
GMAT Score:710

by palvarez » Mon Nov 09, 2009 7:30 am
Treat 2B's and 3C's differently.

B1, B2
C1, C2, C3.

In this case, you have 6! cases.

However, note that B1B2 = B2B1, C1C2 = C2C1, C1C2C3 = C3C2C1, etc.

So, you need to get rid of these redundant entries.

That's why you gotta divide 6! by 2! (for B1 and B2), and by 3! (for C1, C2 and C3, since they are indistinguishable).
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pmFollowed by: 1268 members
Location: Vancouver, BC
Thanked: 5254 times
GMAT Score:770

Re: Permutation question

by Brent@GMATPrepNow » Mon Nov 09, 2009 2:52 pm
sk02 wrote:Hi, could someone provide a more detailed answer for the following permutation question:
Q. How many six-letter sequences consisting of 1A, 2Bs and 3Cs are possible?
The answer guide gave the following:
If all letters in sequence different, 6! sequences possible.
But, arrangement of 2Bs and 3Cs need to be removed, therefore ans = 6! /((2!)(3!))= 60.
I'm having trouble understanding why, to remove the arrangement of 2Bs and 3Cs, the division needs to occur. Thanks. [/url]
In general, the number of permutations of n objects, when a are alike, another b are alike, another c are alike and so on, is:
n!/(a!b!c!...)
Brent Hanneson - Creator of GMATPrepNow.com
Image
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1