Notice that each digit can appear more than once in a code.

Since there should be 4 letters in a code (X-X-X-X) and each letter can take 5 values (A, B, C, D, E) then total # of combinations of the letters only is 5*5*5*5=5^4.

Now, we are told that the first and last digit must be a letter digit, so number digit can take any of the three slots between the letters: X-X-X-X, so 3 positions and the digit itself can take 3 values (1, 2, 3).

So, total # of codes is 5^4*3*3=5,625.

Answer: E.

Similar question to practice: a-4-letter-code-word-consists-of-letters-a-b-and-c-if-the-59065.html

Hope it helps.
_________________

Choose one number from 3 numbers in 3C1 = 3 ways
Choose one position from the middle three for the number in 3C1 = 3 ways
The other four positions can be filled by the 5 letters in 5^4 ways.

Therefore total number of codes possible = 3*3*(5^4) = 5,625

E
_________________

For the first and last positions the letters can be chosen in 5c1 ways, but if we get say the same letter twice then we need to divide by 2! to avoid duplicates since we are looking for different codes.

For the 3 positions in between, we can choose 1 digit in 4c1 ways, and the remaining 2 digits in 5c1 and 5c1 ways. These three can rearrange themselves in 3! ways and we again divide by 2! to avoid duplicates since we can have the letters to repeat themselves. I have shown this below :-

5c1 [(4c1*5c1*5c1)3!]/2! 5c1

1 2 3 4 5

Therefore total according to me would be :-

[(5c1*5c1)/2!]*[(4c1*5c1*5c1)3!]/2! = (25*25*6*4)/4 = 3750.

Can anyone correct where i am making a mistake.

You are allowed duplicates. Even if A appears in the first as well as the last position, it will give you a code different from what you get when you have different letters in the first and the last position. You need to arrange the letters here. If instead you needed to just select groups, then yes, you would have worried about the effect of duplicates.

You select a letter for the first position in 5C1 ways and a letter for the last position in 5C1 ways.
Say you put the digit in the second position. You can select a digit for the second position in 3C1 ways.
You can select the letters for the third and fourth positions in 5C1 and 5C1 ways.
Hence, you get 5*3*5*5*5 codes.
But here, we have put the digit in the second place. It could have been in the third or fourth place too. So you multiply the above given result by 3.
Hence total number of codes = 5*3*5*5*5*3 = 5625
_________________

Bumping for review and further discussion*. Get a kudos point for an alternative solution!

*New project from GMAT Club!!! Check HERE


_________________

Karishma can you tell me wher I am wrong-
1st and last places can be filled in 5 X 5 ways, another 3 this way

5C1X5C1X3C1 and they can be arranged among 3! ways = 5C1X5C1X3C1 x3! = 5x5x3x3x2

finally
5x5x5x5x3x3x2

I am not sure how you have worked this out.

5*5 is fine for first and last positions - they must be letters. But you need 5 digit code so you have another 3 positions to fill

* _ _ _ *

You must use one number digit so you can select a number digit in 3 ways and the position for that number digit in 3 ways.
Also the other two positions must be letters so they can be selected in 5*5 ways.

In all, 5*5*3*3*5*5
_________________

Can someone explain why the first and last digits are 5^2 and not just 5 options?

since repetitions are allowed, there are 5 ways to choose the letters for the first slot, and five ways to choose for last slot

thats 5 x _ x _ x _ x 5

you still have to choose 1 digit and 2 letters between. For the letters, again, repetitions are allowed so each slot can be filled in 5 ways. For digit, it can only be filled in 3 ways. However, since the digit can be in any one of the 3 middle slots, so we multiply by 3 again:

5 x 3 x 5 x 5 x 5 or
5 x 5 x 3 x 5 x 5 or
5 x 5 x 5 x 3 x 5

so 5 x 5 x 5 x 5 x 3 x 3 = 5^4 x 3^2 = 5625.

Let’s determine the number of ways we can produce each digit.

If L denotes a letter digit and N denotes a number digit, the possibilities for the code are L-N-L-L-L, L-L-N-L-L, and L-L-L-N-L. Note that there are an equal number of possible codes for each of these formats, therefore we will find the number of L-N-L-L-L codes and multiply the result by three.

Since the first digit must be a letter, we have 5 options for the first digit. Since the second digit is a number, there are 3 options for the second digit. For the third, fourth, and fifth digits, we have 5 options each. In total, there are 5 x 3 x 5 x 5 x 5 = 1875 L-N-L-L-L codes. Since the total number of codes is three times that, there are 1875 x 3 = 5625 possible codes.

Answer E
_________________

Hi, I am having a hard time understanding the statement "If the first and last digit must be a letter digit"
Doesn't that mean the first and last digit must be a [Letter + Digit]? Like A1 or B1, something like that?
so the code will be
A1 _ _ _ B1, something like that

I know I'm wrong but can you please clarify?
Thanks!

The first and the last symbols must be letters. For example, AAB2B, C3ACC, ...
_________________

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________