|
Author |
Message |
|
TAGS:
|
|
|
Manager
Joined: 09 Feb 2010
Posts: 72
Followers: 0
Kudos [?]:
4
[0], given: 4
|
A local bank that has 15 branches uses a two-digit code to [#permalink]
 27 Jul 2010, 12:25
Question Stats:
68% (01:40) correct
31% (00:45) wrong based on 2 sessions
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
|
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11615
Followers: 1802
Kudos [?]:
9600
[0], given: 829
|
Re: Permutation question [#permalink]
27 Jul 2010, 12:44
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?
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.
_________________
PLEASE READ AND FOLLOW: 11 Rules for Posting!!!
RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory
COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!
What are GMAT Club Tests?
25 extra-hard Quant Tests
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Retired Moderator
Joined: 02 Sep 2010
Posts: 815
Location: London
Followers: 56
Kudos [?]:
302
[0], given: 25
|
Re: Bank combination [#permalink]
19 Sep 2010, 16:02
with k integers, the number of possible codes is k*k=k^2 We need k^2>15 Minimum k is 4. Ans : (b)
_________________
Math write-ups
1) Algebra-101 2) Sequences 3) Set combinatorics 4) 3-D geometry
My GMAT story
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Current Student
Status: Current Student
Joined: 14 Oct 2009
Posts: 370
Schools: Chicago Booth 2013, Ross, Duke , Kellogg , Stanford, Haas
Followers: 13
Kudos [?]:
88
[0], given: 53
|
Re: Permutation question [#permalink]
21 Sep 2010, 16:19
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?
_________________
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11615
Followers: 1802
Kudos [?]:
9600
[0], given: 829
|
Re: Permutation question [#permalink]
22 Sep 2010, 00:00
|
|
|
|
|
|
Senior Manager
Joined: 20 Jul 2010
Posts: 277
Followers: 2
Kudos [?]:
26
[0], given: 9
|
Re: Permutation question [#permalink]
22 Sep 2010, 09:13
Michmax3 wrote: 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
|
|
|
|
|
|
Senior Manager
Joined: 30 Nov 2010
Posts: 267
Schools: UC Berkley, UCLA
Followers: 1
Kudos [?]:
48
[0], given: 66
|
Re: Permutation question [#permalink]
31 Jan 2011, 17:58
Bunuel wrote: 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?
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
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11615
Followers: 1802
Kudos [?]:
9600
[0], given: 829
|
Re: Permutation question [#permalink]
31 Jan 2011, 18:03
mariyea wrote: Bunuel wrote: 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?
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.
_________________
PLEASE READ AND FOLLOW: 11 Rules for Posting!!!
RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory
COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!
What are GMAT Club Tests?
25 extra-hard Quant Tests
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Intern
Joined: 17 Jul 2010
Posts: 15
Location: United States (AL)
GMAT 1: 720 Q49 V39
Followers: 2
Kudos [?]:
7
[0], given: 4
|
Re: Permutation question [#permalink]
31 Jan 2011, 19:29
mariyea,
You used four digits: 0, 1, 2, 3
|
|
|
|
|
|
Senior Manager
Joined: 30 Nov 2010
Posts: 267
Schools: UC Berkley, UCLA
Followers: 1
Kudos [?]:
48
[0], given: 66
|
Re: Permutation question [#permalink]
01 Feb 2011, 06:53
Bunuel wrote:
How many digits did you use?
Answer is B not A.
Well this is kind of embarrassing  Forgot about zero  My bad!
_________________
Thank you for your kudoses Everyone!!!
"It always seems impossible until its done."
-Nelson Mandela
|
|
|
|
|
|
Manager
Joined: 27 Jul 2010
Posts: 199
Location: Prague
Schools: University of Economics Prague
Followers: 1
Kudos [?]:
10
[0], given: 15
|
Re: Permutation question [#permalink]
01 Feb 2011, 18:07
mariyea wrote: Bunuel wrote:
How many digits did you use?
Answer is B not A.
Well this is kind of embarrassing Forgot about zero My bad! Nice one  zero is the everlasting problem, not only by you...
_________________
You want somethin', go get it. Period!
|
|
|
|
|
|
Senior Manager
Joined: 30 Nov 2010
Posts: 267
Schools: UC Berkley, UCLA
Followers: 1
Kudos [?]:
48
[0], given: 66
|
Re: Permutation question [#permalink]
02 Feb 2011, 09:56
craky wrote: mariyea wrote: Bunuel wrote:
How many digits did you use?
Answer is B not A.
Well this is kind of embarrassing Forgot about zero My bad! Nice one zero is the everlasting problem, not only by you... Thank you for trying to keep my confidence intact 
_________________
Thank you for your kudoses Everyone!!!
"It always seems impossible until its done."
-Nelson Mandela
|
|
|
|
|
|
Manager
Joined: 27 Oct 2010
Posts: 190
Followers: 1
Kudos [?]:
6
[0], given: 20
|
Re: Permutation question [#permalink]
02 Feb 2011, 10:22
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.
|
|
|
|
|
|
Manager
Joined: 02 Sep 2012
Posts: 211
Location: United States
Concentration: Entrepreneurship, Finance
GMAT Date: 07-25-2013
GPA: 3.83
WE: Architecture (Computer Hardware)
Followers: 1
Kudos [?]:
29
[0], given: 66
|
A local bank that has 15 branches uses a two-digit code to r [#permalink]
26 Mar 2013, 10:19
A local bank that has 15 branches uses a two-digit code to represent each of its branches. The same integer cannot be used for both digits of a code, 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
_________________
"Giving kudos" is a decent way to say "Thanks" and motivate contributors. Please use them, it won't cost you anything
|
|
|
|
|
|
Director
Joined: 02 Sep 2012
Posts: 570
Location: Italy
Concentration: Finance, Entrepreneurship
GMAT Date: 08-02-2013
GPA: 3.8
Followers: 20
Kudos [?]:
341
[0], given: 78
|
Re: A local bank that has 15 branches uses a two-digit code to r [#permalink]
26 Mar 2013, 10:35
N= number of integers We have Noptions 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 YESC
_________________
Experience without theory is blind, but theory without experience is mere intellectual play.
Immanuel Kant , General Systems
First rule about GMATClub : you do not talk about GMATClub 
Second rule about GMATClub : a great post deserves a +1 KUDOS
Tips and tricks: Inequalities , Mixture | Review: MGMAT workshop
Strategy: SmartGMAT v1.0 | Questions: Verbal challenge SC CR New CR is out! SC coming soon , My Quant
|
|
|
|
|
|
Intern
Joined: 02 May 2012
Posts: 4
Location: Argentina
WE: Corporate Finance (Manufacturing)
Followers: 0
Kudos [?]:
5
[0], given: 40
|
Re: A local bank that has 15 branches uses a two-digit code to r [#permalink]
26 Mar 2013, 10:43
I started from an small matrix :
11 12 13 14 15 16 17
21 22 23 24 25 26 27
31 32 33 34 35 36 37
41 42 43 44 45 46 47
51 52 53 54 55 56 57
61 62 63 64 65 66 67
71 72 73 74 75 76 77
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.
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11615
Followers: 1802
Kudos [?]:
9600
[0], given: 829
|
Re: A local bank that has 15 branches uses a two-digit code to r [#permalink]
27 Mar 2013, 04:48
|
|
|
|
|
|
Intern
Joined: 22 Jan 2010
Posts: 25
Location: India
Concentration: Finance, Technology
GPA: 3.5
WE: Programming (Telecommunications)
Followers: 0
Kudos [?]:
0
[0], given: 3
|
Re: A local bank that has 15 branches uses a two-digit code to [#permalink]
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.
_________________
Please press +1 KUDOS if you like my post.
|
|
|
|
|
|
|
Re: A local bank that has 15 branches uses a two-digit code to
[#permalink]
28 Mar 2013, 00:05
|
|
|
|
|
|
|
|
|
|
|
close
