samarthgupta
A friend asked me this question recently and I wasn't able to get the official answer for this question. I am not sure about the source or the difficulty level. The questions is as follows :-
A 5-digit code consists of one number digit chosen from 1, 2, 3 and four letters chosen from A, B, C, D, E. If the first and last digit must be a letter digit and each digit can appear more than once in a code, how many different codes are possible?
A. 375
B. 625
C. 1,875
D. 3,750
E. 5,625
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:
https://gmatclub.com/forum/a-4-letter-co ... 59065.htmlHope it helps.
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?