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

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

tough sequences

Expert replies
Source: — Problem Solving |

by dmateer25 » Wed Dec 10, 2008 3:00 pm
6!/2!3! = 60
Join the discussion

by albema » Wed Dec 10, 2008 3:07 pm
dmateer25 wrote:6!/2!3! = 60
Can you explain this, please?
Join the discussion

by dmateer25 » Wed Dec 10, 2008 3:36 pm
6 letters can be arranged 6! ways

However, there are 2 B's and 3 C's.

In order to eliminate duplicate arrangements, you must divide by 3! (for the 3 C's)* 2! (For the 2 B's)
Join the discussion

Re: tough sequences

by canuckclint » Wed Dec 10, 2008 6:44 pm
albema wrote:How many different 6-letter sequences are there that consist of 1 A, 2 B’s, and 3 C’s ?

A. 6
B. 60
C. 120
D. 360
E. 720


B
Yes the above is the standard approach. Another intuitive approach is
to have the alphabets into 6 slots.

A BB CCC

For A its 6 c 1 = 6, 6 slots and one A to choose from.
For B its 5 c 2 = 10, 5 slots that can be filled with 2 Bs
For C its 3 c 3 = 1, 3 slots left and 3 Cs to fill with


6 * 10 * 1 = 60

--
Clinton

Bsc Computer Science
Math Minor
Join the discussion

by jnellaz » Thu Dec 11, 2008 8:06 am
First try to find ALL the combinations a 6 letter sequence. Which is equal to: 6 * 5 *4 * 3 * 2 * 1 or 6!.

Then we can try to eliminate duplicates in the sequence. If we break the sequence of letters as follows:

1 2 3 4 5 6
A B1 B2 C1 C2 C3

We can see that there are cases where there will be duplicate sequences. So as a quick example:

A B(1) B(2) C1 C2 C3 will be the same as
A B(2) B(1) C1 C2 C3.

So we have 2 B's = 2! combinations
And 3 C's = 3! combinations

If we divide our original total combinations of a six letter sequence: 6! by 2! and 3! we will get a total of 60 combinations.

Hence - B.
Join the discussion