hard · GMAT Quant
A data entry system generates 4-letter strings: exactly one vowel A, E, I, O, U and three consonants.
If the characters must be distinct and the vowel cannot be in the first or second positions, how many such strings are possible?
- 79,800
- 39,900
- 159,600
- 92,610
- 119,700
Sign up free to see the explanation and track your rank →
More GMAT Quant practice
- Including both endpoints, how many distinct integer price points are in this range?
- Which of the following expressions must result in a positive value?
- Which property of arithmetic justifies that first step?
- Which of the following must also be an even integer?
- Which of the following inequalities correctly represents this range?
- Which of the following includes the number 0?
- How many unique meal combinations can a customer create?
- What is the probability that the lightbulb is functional?