talaangoshtari wrote:How many 5 digit numbers that are divisible by 9 can be formed using the digits 0, 1, 2, 4, 5, 6 if repeats are not allowed?
A.66
B.120
C.360
D.488
E.720
For an integer to be a multiple of 9, the SUM OF ITS DIGITS must be a multiple of 9.
From {0, 1, 2, 4, 5, 6}, only one 5-digit combination will yield a sum that is a multiple of 9:
1+2+4+5+6 = 18.
Thus, the 5-digit integer must be composed of the digits 1, 2, 4, 5 and 6.
The number of ways to arrange these 5 digits = 5! = 120.
The correct answer is
B.
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
