Last visit was: 24 Apr 2026, 12:05 It is currently 24 Apr 2026, 12:05
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
nalinnair
Joined: 09 Jan 2016
Last visit: 20 Nov 2024
Posts: 104
Own Kudos:
4,549
 [18]
Given Kudos: 94
Status:Persevere
Location: Hong Kong
GMAT 1: 750 Q50 V41
GPA: 3.52
Products:
GMAT 1: 750 Q50 V41
Posts: 104
Kudos: 4,549
 [18]
3
Kudos
Add Kudos
15
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 23 Apr 2026
Posts: 16,442
Own Kudos:
79,404
 [5]
Given Kudos: 485
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,442
Kudos: 79,404
 [5]
2
Kudos
Add Kudos
3
Bookmarks
Bookmark this Post
General Discussion
User avatar
premkrishna
Joined: 28 Feb 2014
Last visit: 21 May 2018
Posts: 4
Own Kudos:
Given Kudos: 1
Schools: NTU '17
Schools: NTU '17
Posts: 4
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
nalinnair
Joined: 09 Jan 2016
Last visit: 20 Nov 2024
Posts: 104
Own Kudos:
Given Kudos: 94
Status:Persevere
Location: Hong Kong
GMAT 1: 750 Q50 V41
GPA: 3.52
Products:
GMAT 1: 750 Q50 V41
Posts: 104
Kudos: 4,549
Kudos
Add Kudos
Bookmarks
Bookmark this Post
premkrishna
If N is divisible by 9. The sum of N should also be divisible by 9. Therefore 2(x+y) should be divisible by 9. X and Y are the two distinct integers.

2(x+y) = 18 -----> x+y = 9.
2(x+y) = 09/27 is not possible since this would result in decimal.

x+y = 9 has 18, 27, 36, 45 combinations.

4* (4!/(2!*2!)) = 4* 6 = 24

and one more possible combination is 9,0 in which the first no should be 9. This has 3 possibilities.

so total possibilities is 24+3 = 27 :oops: :oops:

This is the answer I got. Please tell me what am I missing. :cry: :cry:

You are assuming that the two distinct digits are used twice (e.g. 3366). It could be possible that one digit is used thrice and the other digit is used once (e.g. 1116)
This should help you get the answer.

Regards,
Nalin
User avatar
premkrishna
Joined: 28 Feb 2014
Last visit: 21 May 2018
Posts: 4
Own Kudos:
2
 [2]
Given Kudos: 1
Schools: NTU '17
Schools: NTU '17
Posts: 4
Kudos: 2
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
nalinnair
premkrishna
If N is divisible by 9. The sum of N should also be divisible by 9. Therefore 2(x+y) should be divisible by 9. X and Y are the two distinct integers.

2(x+y) = 18 -----> x+y = 9.
2(x+y) = 09/27 is not possible since this would result in decimal.

x+y = 9 has 18, 27, 36, 45 combinations.

4* (4!/(2!*2!)) = 4* 6 = 24

and one more possible combination is 9,0 in which the first no should be 9. This has 3 possibilities.

so total possibilities is 24+3 = 27 :oops: :oops:

This is the answer I got. Please tell me what am I missing. :cry: :cry:

You are assuming that the two distinct digits are used twice (e.g. 3366). It could be possible that one digit is used thrice and the other digit is used once (e.g. 1116)
This should help you get the answer.

Regards,
Nalin


Then the additional combinations would be, 9000(1), 8883(4), 7776(4), 6669(4), 6660(3), 5553(4), 4446(4), 3339(4), 3330(3), 2221(4), 1116(4), 9990(3).
8*4 = 32
3*3 = 9
1*1 = 1
total = 42

Previous was 27. So total 27+42 = 69.
thank you Nalin. :) :-D :-D
User avatar
ShashankDave
Joined: 03 Apr 2013
Last visit: 26 Jan 2020
Posts: 215
Own Kudos:
Given Kudos: 872
Location: India
Concentration: Marketing, Finance
GMAT 1: 740 Q50 V41
GPA: 3
GMAT 1: 740 Q50 V41
Posts: 215
Kudos: 301
Kudos
Add Kudos
Bookmarks
Bookmark this Post
nalinnair
Integer n is a four digit number such that it is made exactly of 2 distinct digits. If n is divisible by 9, how many possible values does n have?

A. 59
B. 60
C. 61
D. 68
E. 69

Self-made. Suggestions welcome.

Regards,
Nalin

Good question +1.

Although I got the answer, but the process is too long and the same as done by others, is something of this sort to be expected in GMAT?
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 23 Apr 2026
Posts: 16,442
Own Kudos:
Given Kudos: 485
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,442
Kudos: 79,404
Kudos
Add Kudos
Bookmarks
Bookmark this Post
ShashankDave
nalinnair
Integer n is a four digit number such that it is made exactly of 2 distinct digits. If n is divisible by 9, how many possible values does n have?

A. 59
B. 60
C. 61
D. 68
E. 69

Self-made. Suggestions welcome.

Regards,
Nalin

Good question +1.

Although I got the answer, but the process is too long and the same as done by others, is something of this sort to be expected in GMAT?

No, I think it is a bit laborious. Perhaps "divisible by 5" or "is even" have a better chance.
User avatar
Jitu20
Joined: 02 May 2020
Last visit: 19 Dec 2022
Posts: 53
Own Kudos:
Given Kudos: 26
GMAT 1: 660 Q47 V35
GMAT 1: 660 Q47 V35
Posts: 53
Kudos: 27
Kudos
Add Kudos
Bookmarks
Bookmark this Post
VeritasKarishma
nalinnair
Integer n is a four digit number such that it is made exactly of 2 distinct digits. If n is divisible by 9, how many possible values does n have?

A. 59
B. 60
C. 61
D. 68
E. 69

Self-made. Suggestions welcome.

Regards,
Nalin

A 4 digit number made of exactly 2 distinct digits can be of 2 kinds:

- MMNN and its arrangements = 4!/2!*2! = 6
- MNNN and its arrangements = 4!/3! = 4

If the number is of the form MMNN, the sum M+N should add up to 9.
So the values can be 0,9 or 1,8... till 4,5.
But 0 is special because it cannot be in the thousands place. So the first digit will be 9 and the other 9 and two 0s will be arranged in 3!/2! = 3 ways only.
Total ways in this case = 3*1 + 6*4 = 27

If the number is of the form MNNN, M+3N should be divisible by 9. This will be divisible by 3, only if M is divisible by 3 too.
So M = 0, N = 3/6/9. Since 0 cannot be in the thousands place, there are only 3 arrangements in each case
M = 3, N = 2/5/8
M = 6, N = 1/4/7
M = 9, N = 0
If N = 0, there is only one arrangement 9000 possible.
M = 9, N = 3/6

Total ways in this case = 3*3 + 4*8 + 1 = 42


Total number of ways = 27 + 42 = 69

Answer (E)

VeritasKarishma could you please explain the part in Red?
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 23 Apr 2026
Posts: 16,442
Own Kudos:
79,404
 [2]
Given Kudos: 485
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,442
Kudos: 79,404
 [2]
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
Jitu20
VeritasKarishma
nalinnair
Integer n is a four digit number such that it is made exactly of 2 distinct digits. If n is divisible by 9, how many possible values does n have?

A. 59
B. 60
C. 61
D. 68
E. 69

Self-made. Suggestions welcome.

Regards,
Nalin

A 4 digit number made of exactly 2 distinct digits can be of 2 kinds:

- MMNN and its arrangements = 4!/2!*2! = 6
- MNNN and its arrangements = 4!/3! = 4

If the number is of the form MMNN, the sum M+N should add up to 9.
So the values can be 0,9 or 1,8... till 4,5.
But 0 is special because it cannot be in the thousands place. So the first digit will be 9 and the other 9 and two 0s will be arranged in 3!/2! = 3 ways only.
Total ways in this case = 3*1 + 6*4 = 27

If the number is of the form MNNN, M+3N should be divisible by 9. This will be divisible by 3, only if M is divisible by 3 too.
So M = 0, N = 3/6/9. Since 0 cannot be in the thousands place, there are only 3 arrangements in each case
M = 3, N = 2/5/8
M = 6, N = 1/4/7
M = 9, N = 0
If N = 0, there is only one arrangement 9000 possible.
M = 9, N = 3/6

Total ways in this case = 3*3 + 4*8 + 1 = 42


Total number of ways = 27 + 42 = 69

Answer (E)

VeritasKarishma could you please explain the part in Red?

Two Cases:

1. MMNN and its arrangements (MNMN, NNMM etc)

We found 27 of these total cases.



2. MNNN and its arrangements (NNMN, NNNM etc)

M = 0, N = 3/6/9. Since 0 cannot be in the thousands place, there are only 3 arrangements in each case (NMNN, NNMN, NNNM)
So 3 arrangements for M= 0, N = 3; (3033, 3303, 3330)
3 arrangements for M= 0, N = 6;
3 arrangements for M= 0, N = 9;


M = 3, N = 2/5/8
There are 4 arrangements for each case.
M = 3, N = 2 gives 3222, 2322, 2232, 2223
Similarly 4 arrangements for M = 3, N = 5
4 arrangements for M = 3, N = 8
4 arrangements for M = 6, N = 1
4 arrangements for M = 6, N = 4
4 arrangements for M = 6, N = 7
4 arrangements for M = 9, N = 3
4 arrangements for M = 9, N = 6

If M = 9, N = 0, then only 1 arrangement is possible (9000.. rest 3 are not possible 0900, 0090 etc)

So total 42 arrangements here.

Total = 27 + 42
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,975
Own Kudos:
Posts: 38,975
Kudos: 1,117
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderators:
Math Expert
109818 posts
Tuck School Moderator
853 posts