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.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
A local bank that has 15 branches uses a two-digit code to [#permalink]
Show Tags
27 Jul 2010, 12:25
1
13
00:00
A
B
C
D
E
Difficulty:
35% (medium)
Question Stats:
66% (01:06) correct 34% (01:10) wrong based on 521 sessions
HideShow timer Statistics
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?
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.
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?
_________________
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.
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?
n * (n-1) is to say that 99 will not be chosen. To choose 99 once we are saying n*n should be the combo
_________________
If you like my post, consider giving me some KUDOS !!!!! Like you I need them
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?
_________________
Thank you for your kudoses Everyone!!!
"It always seems impossible until its done." -Nelson Mandela
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.
Starting with choice A, 3 * 3 = 9 options are possible to code 15 branches. Not suff. Using 4 in choice B, 4 * 4 = 16 options are possible. We need the fewest. So B.
Re: A local bank that has 15 branches uses a two-digit code to r [#permalink]
Show Tags
26 Mar 2013, 10:35
\(N\)= number of integers We have \(N\)options for the first one, \(N-1\) options for the second. So a total of \(N(N-1)\) combinations, and we want that \(N(N-1)=15\). Now or you plug in the different options, or you solve \(N^2-N-15=0\); the first way seems faster, so lets try with A) 3 : 3*2=6 No B)4*3=12 No again C)5*4=20 YES
C
_________________
It is beyond a doubt that all our knowledge that begins with experience.
Then I highlight the possible combinations (not considering the numbers with repeated integers) For example with 1 integer there are nor any number possible, with 2 integers, 2 possible numbers, with 3 integers , 6 possible numbers, with 4 integers, 12 possible numbers, and with 5 ... 20 . Correct Answer C
I know it´s not the finest answer, I guess it should be explained with combinatory.
Re: A local bank that has 15 branches uses a two-digit code to [#permalink]
Show Tags
28 Mar 2013, 00:05
Let the required number of digits be n. Considering the given conditions, i)The first digit can be filled up in n ways. ii)The second digit can be filled up in n ways too. So we will get \(n * n = n^2\) numbers.
\(n^2 \geq 15\)
=>\(n \geq 4\) [since n is an integer.]
So,option B will be the correct answer. ------------------------------------------- Please press KUDOS if you like my post. _________________
Re: A local bank that has 15 branches uses a two-digit code to [#permalink]
Show Tags
19 Aug 2014, 08:24
1
More easy solution. Think logically.
Pick any two integer.
Integers: 1 & 2
Code: 11, 12, 21, 22 = 4 Codes
Add one more integer: 3
13, 31, 33, 23, 32 = 5 Codes
Add one more integer: 4
44, 14, 41, 24, 42, 34, 43 = 7 Codes
Total = 16 Codes. Enough. Answer: B
2 integers create 4 codes. we need 15 codes.
zest4mba wrote:
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?
Re: A local bank that has 15 branches uses a two-digit code to [#permalink]
Show Tags
02 Oct 2014, 08:35
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?
A. 3 B. 4 C. 5 D. 6 E. 7
We can write that XC1 + XP2 = 15 Lets take X=3 3+ 6 = 9
Now lets take X=4 4 + 12 = 16 - This is close to our answer. Hence B is the answer
_________________
A local bank that has 15 branches uses a two-digit code to [#permalink]
Show Tags
02 Dec 2015, 23:51
1
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
gmatclubot
A local bank that has 15 branches uses a two-digit code to
[#permalink]
02 Dec 2015, 23:51
close
66% (01:06) correct 
Forgot about zero 
My bad!
zero is the everlasting problem, not only by you...
