Last visit was: 13 Jun 2025, 21:34 It is currently 13 Jun 2025, 21:34
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
zest4mba
Joined: 09 Feb 2010
Last visit: 09 May 2012
Posts: 38
Own Kudos:
880
 [84]
Given Kudos: 4
Posts: 38
Kudos: 880
 [84]
4
Kudos
Add Kudos
80
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 13 Jun 2025
Posts: 102,007
Own Kudos:
Given Kudos: 93,852
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,007
Kudos: 732,097
 [14]
5
Kudos
Add Kudos
9
Bookmarks
Bookmark this Post
General Discussion
User avatar
shrouded1
User avatar
Retired Moderator
Joined: 02 Sep 2010
Last visit: 29 Apr 2018
Posts: 609
Own Kudos:
3,111
 [1]
Given Kudos: 25
Location: London
 Q51  V41
Products:
Posts: 609
Kudos: 3,111
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
User avatar
Michmax3
Joined: 14 Oct 2009
Last visit: 30 Jun 2012
Posts: 353
Own Kudos:
Given Kudos: 53
Status:Current Student
Concentration: CPG Marketing
Schools:Chicago Booth 2013, Ross, Duke , Kellogg , Stanford, Haas
 Q41  V42
GPA: 3.8
Products:
Posts: 353
Kudos: 258
Kudos
Add Kudos
Bookmarks
Bookmark this Post
I'm confused how xy would have n*n possibilities...wouldn't it b n*(n-1) possibilities because you would have to have two different digits? For example 17 and 71 are two different codes but 99 and 99 are the same code. Can someone explain?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 13 Jun 2025
Posts: 102,007
Own Kudos:
732,097
 [1]
Given Kudos: 93,852
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,007
Kudos: 732,097
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Michmax3
I'm confused how xy would have n*n possibilities...wouldn't it b n*(n-1) possibilities because you would have to have two different digits? For example 17 and 71 are two different codes but 99 and 99 are the same code. Can someone explain?

It's always good to test theoretical thoughts on practice:

How many codes can be formed using 2 digits (\(n=2\)), 0 and 1.:

00;
01;
10;
11.

4=2^2.

Or consider the following: how many 2-digit codes can be formed out of 10 digits (0, 1, 2, 3, ..., 9)?
00;
01;
02;
...
99.

Total 100=10^2.

Hope it's clear.
User avatar
mariyea
Joined: 30 Nov 2010
Last visit: 06 Dec 2011
Posts: 185
Own Kudos:
Given Kudos: 66
Schools:UC Berkley, UCLA
GMAT 2: 540 GMAT 3: 530
Posts: 185
Kudos: 276
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
zest4mba
A local bank that has 15 branches uses a two-digit code to represent each of its branches. The same integer can be used for both digits of a code, and a pair of two-digit numbers that are the reverse of each other (such as 17 and 71) are considered as two separate codes. What is the fewest number of different integers required for the 15 codes?

Choices
A 3

B 4

C 5

D 6

E 7

Consider the code XY. If there are \(n\) digits available then X can take \(n\) values and Y can also take \(n\) values, thus from \(n\) digits we can form \(n^2\) different 2-digit codes: this is the same as from 10 digits (0, 1, 2, 3, ..., 9) we can form 10^2=100 different 2-digit numbers (00, 01, 02, ..., 99).

We want # of codes possible from \(n\) digit to be at least 15 --> \(n^2\geq{15}\) --> \(n\geq4\), hence min 4 digits are required.

Answer: B.

Hope it's clear.
Actually it could be A. B/c think of these arrangements for the 15 codes.

00, 01, 10, 02, 20, 03, 30, 11, 21, 12, 31, 13, 22, 23, 32 and 33. We have 16 arrangements so minimum # of different integers used can be 3.

What do you think?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 13 Jun 2025
Posts: 102,007
Own Kudos:
732,097
 [1]
Given Kudos: 93,852
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,007
Kudos: 732,097
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
mariyea
Bunuel
zest4mba
A local bank that has 15 branches uses a two-digit code to represent each of its branches. The same integer can be used for both digits of a code, and a pair of two-digit numbers that are the reverse of each other (such as 17 and 71) are considered as two separate codes. What is the fewest number of different integers required for the 15 codes?

Choices
A 3

B 4

C 5

D 6

E 7

Consider the code XY. If there are \(n\) digits available then X can take \(n\) values and Y can also take \(n\) values, thus from \(n\) digits we can form \(n^2\) different 2-digit codes: this is the same as from 10 digits (0, 1, 2, 3, ..., 9) we can form 10^2=100 different 2-digit numbers (00, 01, 02, ..., 99).

We want # of codes possible from \(n\) digit to be at least 15 --> \(n^2\geq{15}\) --> \(n\geq4\), hence min 4 digits are required.

Answer: B.

Hope it's clear.
Actually it could be A. B/c think of these arrangements for the 15 codes.

00, 01, 10, 02, 20, 03, 30, 11, 21, 12, 31, 13, 22, 23, 32 and 33. We have 16 arrangements so minimum # of different integers used can be 3.

What do you think?

How many digits did you use?

Answer is B not A.
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 13 Jun 2025
Posts: 102,007
Own Kudos:
Given Kudos: 93,852
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,007
Kudos: 732,097
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Temurkhon
Joined: 23 Jan 2013
Last visit: 06 Apr 2019
Posts: 415
Own Kudos:
302
 [2]
Given Kudos: 43
Schools: Cambridge'16
Schools: Cambridge'16
Posts: 415
Kudos: 302
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Try to explain why Permutation formula does not fully work here

if we have 4 distinct numbers, e.g. 0,1,2,3

00,01,02,03
10,11,12,13
20,21,22,23
30,31,32,33
we have 16 options (of 2 numbers taken)

permutation formula is P=n!/(n-2)!, so if n=4 we get only 12 options.

But formula defines how many times the arrangements of 4 distinct objects is that of any 2 distinct objects.
So, it excludes 00,11,22,33 from the list, i.e. 4 options

So, 12+4=16 and 4 numbers is enough

B
User avatar
anirchat
Joined: 30 Jun 2024
Last visit: 08 Jun 2025
Posts: 196
Own Kudos:
Given Kudos: 297
Posts: 196
Kudos: 35
Kudos
Add Kudos
Bookmarks
Bookmark this Post
If we assume we need n distinct digits, the solution equaltion will be nP2 + n >= 15. Now substituting 1,2,3,4, etc. in the solution equaltion, we get for n=3, it's 6+3 = 9 but for n= 4, we get 12 + 4 = 16.

Therefore, B) 4 is the answerr.
Moderators:
Math Expert
102007 posts
PS Forum Moderator
633 posts