Max@Math Revolution wrote:We make 4 digit codes and each digit of the code form from 1, 2, 3, and 4. If none of each digit use more than once, eg, 1234 can be a code but 1124 cannot be a code, what is the sum of all the possible codes?
A. 56,660
B. 58,660
C. 60,660
D. 66,660
E. 68,660
Number of options for the thousands place = 4. (Any of the 4 digits.)
Number of options for the hundreds place = 3. (Any of the 3 remaining digits.)
Number of options for the tens place = 2. (Any of the 2 remaining digits.)
Number of options for the units place = 1. (Only 1 digit left.)
To combine these options, we multiply:
Total number of codes = 4*3*2*1 = 24.
Each digit will appear in each position 24/4 = 6 times.
Thus, in each position, there will be six 1's, six 2's, six 3's, and six 4's.
Sum of the digits in each position = 6(1+2+3+4) = 60.
Sum of the thousands place = 60*1000 = 60,000.
Sum of the hundreds place =60*100 =6,000.
Sum of the tens place = 60*10 = 600.
Sum of the units place = 60*1 = 60.
Sum of all the codes = 60000 + 6000 + 600 + 60 = 66,660.
The correct answer is
D.
Last edited by
GMATGuruNY on Tue Jun 11, 2019 10:59 am, edited 1 time 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