Simplastic

[j_shreyans]

The Simplastic language has only 2 unique values and 3 unique consonants. Every noun in Simplastic has the structure CVCVC, where C stands for a consonant and V stands for a vowel. How many different nouns are possible in Simplastic?

A)9
B)12
C)36
D)72
E)108

OAE

[[email protected]]

Hi j_shreyans,

The question you posted has a small typo in it. I believe it's means to say....

2 unique Vowels
3 unique Consonants

We're asked for all of the various 5 letter "nouns" that follow the pattern CVCVC (in which C is a consonant and V is a vowel) and that could occur in this language.

This is essentially just a permutation question. Since there are 3 different consonants and 2 different vowels, we would end up with...

(3)(2)(3)(2)(3) = 108 different 5 letter "nouns"

Final Answer: E

GMAT assassins aren't born, they're made,
Rich

[Brent@GMATPrepNow]

The Simplastic language has only 2 unique VOWELS and 3 unique CONSONANTS. Every noun in Simplastic has the structure CVCVC, where C stands for a consonant and V stands for a vowel. How many different nouns are possible in Simplastic?

A)9
B)12
C)36
D)72
E)108

OAE

NOTE: based on the OA, I'm assuming that it's okay to use a letter more than once.

Take the task of creating nouns and break it into stages.

Stage 1: Choose a consonant for the 1st letter.
There are 3 consonants to choose from, so, we can complete stage 1 in 3 ways

Stage 2: Choose a vowel for the 2nd letter.
There are 2 vowels to choose from, so, we can complete stage 2 in 2 ways

Stage 3: Choose a consonant for the 3rd letter.
There are 3 consonants to choose from, so, we can complete stage 3 in 3 ways

Stage 4: Choose a vowel for the 4th letter.
There are 2 vowels to choose from, so, we can complete stage 4 in 2 ways

Stage 5: Choose a consonant for the 5th letter.
There are 3 consonants to choose from, so, we can complete stage 5 in 3 ways

By the Fundamental Counting Principle (FCP), we can complete all 5 stages (and thus create a noun) in (3)(2)(3)(2)(3) ways ([spoiler]= 108 ways[/spoiler])

Answer: E
--------------------------

Note: the FCP can be used to solve the MAJORITY of counting questions on the GMAT. For more information about the FCP, watch our free video: https://www.gmatprepnow.com/module/gmat-counting?id=775

Then you can try solving the following questions:

EASY
- https://www.beatthegmat.com/what-should- ... 67256.html
- https://www.beatthegmat.com/counting-pro ... 44302.html
- https://www.beatthegmat.com/picking-a-5- ... 73110.html
- https://www.beatthegmat.com/permutation- ... 57412.html
- https://www.beatthegmat.com/simple-one-t270061.html
- https://www.beatthegmat.com/mouse-pellets-t274303.html


MEDIUM
- https://www.beatthegmat.com/combinatoric ... 73194.html
- https://www.beatthegmat.com/arabian-hors ... 50703.html
- https://www.beatthegmat.com/sub-sets-pro ... 73337.html
- https://www.beatthegmat.com/combinatoric ... 73180.html
- https://www.beatthegmat.com/digits-numbers-t270127.html
- https://www.beatthegmat.com/doubt-on-sep ... 71047.html
- https://www.beatthegmat.com/combinatoric ... 67079.html


DIFFICULT
- https://www.beatthegmat.com/wonderful-p- ... 71001.html
- https://www.beatthegmat.com/ps-counting-t273659.html
- https://www.beatthegmat.com/permutation- ... 73915.html
- https://www.beatthegmat.com/please-solve ... 71499.html
- https://www.beatthegmat.com/no-two-ladie ... 75661.html
- https://www.beatthegmat.com/laniera-s-co ... 15764.html

Cheers,
Brent

[RiyaR]

If no repetition were to be allowed, would the number of eays be 12?

[[email protected]]

Hi RiraR,

Yes, if duplicate letters were NOT allowed, the math would be:

(3)(2)(2)(1)(1) = 12 different "words"

You'll notice that the math "steps" are remarkably similar to what we did to answer the original question. These types of questions are ultimately about following the "rules" that the question lays out.

GMAT assassins aren't born, they're made,
Rich