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
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
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.

715+ 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.

Each letter of a 5-letter password must be a different lette

Expert replies
by Max@Math Revolution » Wed Apr 11, 2018 4:46 am

Timer

00:00

Answers

A

B

C

D

E

Stats

Difficulty

[GMAT math practice question]

Each letter of a 5-letter password must be a different letter of the alphabet. Each password must contain 2 vowels and 3 consonants, and the vowels must not be adjacent to each other. How many different passwords of this form can be made?

A. 957600
B. 128000
C. 159600
D. 256000
E. 720000 $$$$ $$$$
Last edited by Max@Math Revolution on Sun Apr 15, 2018 7:25 pm, edited 1 time in total.
Join the discussion
Source: — Problem Solving |

edit

by Max@Math Revolution » Fri Apr 13, 2018 1:29 am
=>

The total number of passwords with 2 vowels and 3 consonants is determined as follows:
1) Choose the 2 different vowels in 5C2 ways
2) Choose the 3 consonants in 21C3 ways
3) Arrange the 5 letters in 5! ways
So, the number of passwords is
21C3 * 5C2 * 5! = ( 21*20*19 ) / (1*2*3) * (5*4)/(1*2) * 120 = 1330 * 10 * 120 = 1596000.

The number of passwords with 2 adjacent vowels and 3 consonants is
determined as follows:
1) Choose the 2 different vowels in 5C2 ways
2) Choose the 3 consonants in 21C3 ways
3) Choose a position for the two adjacent vowels in 4! ways
4) Rearrange the adjacent vowels in 2! ways
So, the number of passwords with two adjacent vowels is

21C3 * 5C2 * 4!*2! = ( 21*20*19 ) / (1*2*3) * (5*4)/(1*2) * 48 = 1330 * 10 * 48 = 638400.

Therefore, the number of passwords without two adjacent vowels is
1596000 - 638400 = 957600.

Therefore, the answer is A.

Answer: A
Last edited by Max@Math Revolution on Sun Apr 15, 2018 7:29 pm, edited 2 times in total.
Join the discussion

password

by GMATGuruNY » Fri Apr 13, 2018 5:11 am
Max@Math Revolution wrote:[GMAT math practice question]

Each letter of a 5-letter password must be a different letter of the alphabet. Each password must contain 2 vowels and 3 consonants, and the vowels must not be adjacent to each other. How many different passwords of this form can be made?

A. 95760
B. 128000
C. 159600
D. 256000
E. 720000
From the 5 slots in the sequence, the number of ways to choose 2 slots for the 2 vowels = 5C2 = (5*4)/(2*1) = 10.
Of these 10 options, the following 4 combinations are composed of adjacent slots and thus are not allowed:
Slots 1 and 2
Slots 2 and 3
Slots 3 and 4
Slots 4 and 5
Thus:
Number of slot options for the 2 vowels = (total ways to choose 2 slots) - (number of ways to choose 2 adjacent slots) = 10-4 = 6.

In the 26-letter alphabet are 5 vowels -- a, e, i, o, u -- and 21 consonants.
Thus:
Number of options for the first vowel = 5. (Any of the 5 vowels.)
Number of options for the second vowel = 4. (Any of the 4 remaining vowels.)
Number of options for the first consonant = 21. (Any of the 21 consonants.)
Number of options for the second consonant = 20. (Any of the 20 remaining consonants.)
Number of options for the third consonant = 19. (Any of the 19 remaining consonants.)

To combine the options in blue, we multiply:
6*5*4*21*19*20 ≈ 120*20*20*20 = 120*8000 = 960000.

The OA is incorrect.
It should be 957,600.
Last edited by GMATGuruNY on Fri Apr 13, 2018 9:03 am, edited 2 times in total.
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
Join the discussion

password

by GMATGuruNY » Fri Apr 13, 2018 5:29 am
The total number of passwords with 2 vowels and 3 consonants is determined as follows:
1) Choose the 2 different vowels in 5C2 ways
2) Choose the 3 consonants in 21C3 ways
3) Arrange the 5 letters in 5! ways
So, the number of passwords is
21C3 * 5C2 * 5! = ( 21*20*19 ) / (1*2*3) * (5*4)/(1*2) * 120 = 133 * 10 * 120 = 159600.

The number of passwords with 2 adjacent vowels and 3 consonants is
determined as follows:
1) Choose the 2 different vowels in 5C2 ways
2) Choose the 3 consonants in 21C3 ways
3) Choose a position for the two adjacent vowels in 4! ways
4) Rearrange the adjacent vowels in 2! ways
So, the number of passwords with two adjacent vowels is

21C3 * 5C2 * 4!*2! = ( 21*20*19 ) / (1*2*3) * (5*4)/(1*2) * 48 = 133 * 10 * 48 = 63840.

Therefore, the number of passwords without two adjacent vowels is
159600 - 63840 = 95760.

Therefore, the answer is A.

Answer: A
The values in red are incorrect.
(21*20*19)/(1*2*3) = 1330.
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
Join the discussion