January 26, 2019 January 26, 2019 07:00 AM PST 09:00 AM PST Attend this webinar to learn how to leverage Meaning and Logic to solve the most challenging Sentence Correction Questions. January 27, 2019 January 27, 2019 07:00 AM PST 09:00 AM PST Attend this webinar to learn a structured approach to solve 700+ Number Properties question in less than 2 minutes.
Author 
Message 
TAGS:

Hide Tags

Intern
Joined: 12 May 2012
Posts: 19
Location: United States
Concentration: Technology, Human Resources

A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
Updated on: 17 Jun 2012, 03:20
Question Stats:
58% (01:17) correct 42% (01:31) wrong based on 3351 sessions
HideShow timer Statistics
A researcher plans to identify each participant in a certain medical experiment with a code consisting of either a single letter or a pair of distinct letters written in alphabetical order. What is the least number of letters that can be used if there are 12 participants, and each participant is to receive a different code? A. 4 B. 5 C. 6 D. 7 E. 8
Official Answer and Stats are available only to registered users. Register/ Login.
Originally posted by sarb on 17 Jun 2012, 03:13.
Last edited by Bunuel on 17 Jun 2012, 03:20, edited 1 time in total.
Edited the question.




Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
17 Jun 2012, 03:24
sarb wrote: A researcher plans to identify each participant in a certain medical experiment with a code consisting of either a single letter or a pair of distinct letters written in alphabetical order. What is the least number of letters that can be used if there are 12 participants, and each participant is to receive a different code?
A. 4 B. 5 C. 6 D. 7 E. 8 Say there are minimum of \(n\) letters needed, then; The # of single letter codes possible would be \(n\) itself; The # of pair of distinct letters codes possible would be \(C^2_n\) (in alphabetical order); We want \(C^2_n+n\geq{12}\) > \(\frac{n(n1)}{2}+n\geq{12}\) > \(n(n1)+2n\geq{24}\) > \(n(n+1)\geq{24}\) > \(n_{min}=5\). Answer: B. Hope it's clear.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics




Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
17 Jun 2012, 03:34



Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
17 Jun 2012, 03:49
Almost identical question: John has 12 clients and he wants to use color coding to identify each client. If either a single color or a pair of two different colors can represent a client code, what is the minimum number of colors needed for the coding? Assume that changing the color order within a pair does not produce different codes.A. 24 B. 12 C. 7 D. 6 E. 5 The concept is not that hard. We can use combination or trial and error approach. Combination approach:Let # of colors needed be \(n\), then it must be true that \(n+C^2_n\geq{12}\) (\(C^2_n\)  # of ways to choose the pair of different colors from \(n\) colors when order doesn't matter) > \(n+\frac{n(n1)}{2}\geq{12}\) > \(2n+n(n1)\geq{24}\) > \(n(n+1)\geq{24}\) > as \(n\) is an integer (it represents # of colors) \(n\geq{5}\) > \(n_{min}=5\). Trial and error approach: If the minimum number of colors needed is 4 then there are 4 single color codes possible PLUS \(C^2_4=6\) twocolor codes > 4+6=10<12 > not enough for 12 codes; If the minimum number of colors needed is 5 then there are 5 single color codes possible PLUS \(C^2_5=10\) twocolor codes > 5+10=15>12 > more than enough for 12 codes. Actually as the least answer choice is 5 then if you tried it first you'd get the correct answer right away. Answer: E. Hope it helps.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Intern
Joined: 27 Aug 2012
Posts: 14

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
01 Dec 2012, 19:10
Bunnel. Thaks for the reply and merging similar topics. Can u please explain how >= 12 ?



Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
02 Dec 2012, 03:51



Senior Manager
Joined: 07 Apr 2012
Posts: 359

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
02 Dec 2012, 13:48
Hi Bunnel
won't this \(C^2_n\) just give you all the pairs available? we need them also ordered....



Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
03 Dec 2012, 01:30



Manager
Joined: 24 Mar 2010
Posts: 64

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
23 Dec 2012, 12:22
Bunuel wrote: sarb wrote: A researcher plans to identify each participant in a certain medical experiment with a code consisting of either a single letter or a pair of distinct letters written in alphabetical order. What is the least number of letters that can be used if there are 12 participants, and each participant is to receive a different code?
A. 4 B. 5 C. 6 D. 7 E. 8 Say there are minimum of \(n\) letters needed, then; The # of single letter codes possible would be \(n\) itself; The # of pair of distinct letters codes possible would be \(C^2_n\) (in alphabetical order); We want \(C^2_n+n\geq{12}\) > \(\frac{n(n1)}{2}+n\geq{12}\) > \(n(n1)+2n\geq{24}\) > \(n(n+1)\geq{24}\) > \(n_{min}=5\). Answer: B. Hope it's clear. Bunuel, What if the question didn't say 'pair'. If 3 letter combinations were also permitted. How would you express it in Combination formula?
_________________
 Stay Hungry, stay Foolish 



Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
23 Dec 2012, 23:41
eaakbari wrote: Bunuel wrote: sarb wrote: A researcher plans to identify each participant in a certain medical experiment with a code consisting of either a single letter or a pair of distinct letters written in alphabetical order. What is the least number of letters that can be used if there are 12 participants, and each participant is to receive a different code?
A. 4 B. 5 C. 6 D. 7 E. 8 Say there are minimum of \(n\) letters needed, then; The # of single letter codes possible would be \(n\) itself; The # of pair of distinct letters codes possible would be \(C^2_n\) (in alphabetical order); We want \(C^2_n+n\geq{12}\) > \(\frac{n(n1)}{2}+n\geq{12}\) > \(n(n1)+2n\geq{24}\) > \(n(n+1)\geq{24}\) > \(n_{min}=5\). Answer: B. Hope it's clear. Bunuel, What if the question didn't say 'pair'. If 3 letter combinations were also permitted. How would you express it in Combination formula? Practice: try to use the same concept.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Manager
Joined: 24 Mar 2010
Posts: 64

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
24 Dec 2012, 00:28
Bunuel wrote: Practice: try to use the same concept.
Okay here goes, The # of single letter codes possible would be \(n\) itself; The # of pair of distinct letters codes possible would be (in alphabetical order); \(nC2\) The # of Triples of distinct letters codes possible would be (in alphabetical order); \(nC3\) Thus \(nC3 + nC2 + n\) > \(12\) \(n*(n1)/2 + n*(n1)*(n2)/3*2 + n\) > \(12\) Simplifying \(n*(n^2 +5)\) > \(72\) Only sufficient value of \(n = 4\) Is it correct?
_________________
 Stay Hungry, stay Foolish 



Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
24 Dec 2012, 00:49
eaakbari wrote: Bunuel wrote: Practice: try to use the same concept.
Okay here goes, The # of single letter codes possible would be \(n\) itself; The # of pair of distinct letters codes possible would be (in alphabetical order); \(nC2\) The # of Triples of distinct letters codes possible would be (in alphabetical order); \(nC3\) Thus \(nC3 + nC2 + n\) > \(12\) \(n*(n1)/2 + n*(n1)*(n2)/3*2 + n\) > \(12\) Simplifying \(n*(n^2 +5)\) > \(72\) Only sufficient value of \(n = 4\) Is it correct? Correct. Three letters A, B, and C, are enough for 7<12 codes: A; B; C; AB; AC; BC; ABC. Four letters A, B, C, and D are enough for 15>12 codes: A; B; C; D; AB; AC; AD; BC; BD; CD; ABC; ABD; ACD; BCD; ABCD.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
22 Nov 2013, 14:21



Intern
Joined: 12 Mar 2011
Posts: 15

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
22 Nov 2013, 14:37
Bunuel wrote: ronr34 wrote: Hi Bunnel
won't this \(C^2_n\) just give you all the pairs available? we need them also ordered.... Notice that we are told that letters in the code should be written in alphabetical order. Now, 2Cn gives different pairs of 2 letters possible out of n letters, but since codes should be written in one particular order (alphabetical), then for each pair there will be only one ordering possible, thus the number of codes out of n letters equals to number of pairs out of n letters. Hope it's clear. Hi Bunuel, From n letters we choose the number of pairs, the result will be \(C^2_n\) which may include 2 kinds of pairs (AB) and (BA). Still confused .



Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
22 Nov 2013, 14:43
yenpham9 wrote: Bunuel wrote: ronr34 wrote: Hi Bunnel
won't this \(C^2_n\) just give you all the pairs available? we need them also ordered.... Notice that we are told that letters in the code should be written in alphabetical order. Now, 2Cn gives different pairs of 2 letters possible out of n letters, but since codes should be written in one particular order (alphabetical), then for each pair there will be only one ordering possible, thus the number of codes out of n letters equals to number of pairs out of n letters. Hope it's clear. Hi Bunuel, From n letters we choose the number of pairs, the result will be \(C^2_n\) which may include 2 kinds of pairs (AB) and (BA). Still confused . Maybe the following example would help. Consider 4 letters {a, b, c, d}. How many 2letter words in alphabetical order are possible? The answer is \(C^2_4=6\): ab; ac; ad; bc; bd; cd.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Senior Manager
Status: Verbal Forum Moderator
Joined: 17 Apr 2013
Posts: 480
Location: India
GMAT 1: 710 Q50 V36 GMAT 2: 750 Q51 V41 GMAT 3: 790 Q51 V49
GPA: 3.3

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
25 Nov 2013, 03:38
Bunuel wrote: sarb wrote: A researcher plans to identify each participant in a certain medical experiment with a code consisting of either a single letter or a pair of distinct letters written in alphabetical order. What is the least number of letters that can be used if there are 12 participants, and each participant is to receive a different code?
A. 4 B. 5 C. 6 D. 7 E. 8 Say there are minimum of \(n\) letters needed, then; The # of single letter codes possible would be \(n\) itself; The # of pair of distinct letters codes possible would be \(C^2_n\) (in alphabetical order); We want \(C^2_n+n\geq{12}\) > \(\frac{n(n1)}{2}+n\geq{12}\) > \(n(n1)+2n\geq{24}\) > \(n(n+1)\geq{24}\) > \(n_{min}=5\). Answer: B. Hope it's clear. we can take 1,2 and 3 like A, B, C AB, BC ABC Why did you ignored possibility of 3 or 4 alphabets taken together, this will give us 4 letters?
_________________
Like my post Send me a Kudos It is a Good manner. My Debrief: http://gmatclub.com/forum/howtoscore750and750imovedfrom710to189016.html



Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
25 Nov 2013, 03:41
honchos wrote: Bunuel wrote: sarb wrote: A researcher plans to identify each participant in a certain medical experiment with a code consisting of either a single letter or a pair of distinct letters written in alphabetical order. What is the least number of letters that can be used if there are 12 participants, and each participant is to receive a different code?
A. 4 B. 5 C. 6 D. 7 E. 8 Say there are minimum of \(n\) letters needed, then; The # of single letter codes possible would be \(n\) itself; The # of pair of distinct letters codes possible would be \(C^2_n\) (in alphabetical order); We want \(C^2_n+n\geq{12}\) > \(\frac{n(n1)}{2}+n\geq{12}\) > \(n(n1)+2n\geq{24}\) > \(n(n+1)\geq{24}\) > \(n_{min}=5\). Answer: B. Hope it's clear. we can take 1,2 and 3 like A, B, C AB, BC ABC Why did you ignored possibility of 3 or 4 alphabets taken together, this will give us 4 letters? Please read the question carefully: a code consists of either a single letter or a pair of distinct letters written in alphabetical order.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Senior Manager
Status: Verbal Forum Moderator
Joined: 17 Apr 2013
Posts: 480
Location: India
GMAT 1: 710 Q50 V36 GMAT 2: 750 Q51 V41 GMAT 3: 790 Q51 V49
GPA: 3.3

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
25 Nov 2013, 03:47
Lets take A B C D A B C D AB AC AD BC BD CD ABC BCA CBA It is alphabetical and all letter for a particular codes are different.
_________________
Like my post Send me a Kudos It is a Good manner. My Debrief: http://gmatclub.com/forum/howtoscore750and750imovedfrom710to189016.html



Math Expert
Joined: 02 Sep 2009
Posts: 52431

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
25 Nov 2013, 03:51



Intern
Joined: 20 Nov 2013
Posts: 25

Re: A researcher plans to identify each participant in a certain
[#permalink]
Show Tags
25 Feb 2014, 07:57
Bunuel wrote: sarb wrote: A researcher plans to identify each participant in a certain medical experiment with a code consisting of either a single letter or a pair of distinct letters written in alphabetical order. What is the least number of letters that can be used if there are 12 participants, and each participant is to receive a different code?
A. 4 B. 5 C. 6 D. 7 E. 8 Say there are minimum of \(n\) letters needed, then; The # of single letter codes possible would be \(n\) itself; The # of pair of distinct letters codes possible would be \(C^2_n\) (in alphabetical order); We want \(C^2_n+n\geq{12}\) > \(\frac{n(n1)}{2}+n\geq{12}\) > \(n(n1)+2n\geq{24}\) > \(n(n+1)\geq{24}\) > \(n_{min}=5\). Answer: B. Hope it's clear. I have a questions here: How did we get from \(n(n+1)\geq{24}\) to \(n_{min}=5\)




Re: A researcher plans to identify each participant in a certain &nbs
[#permalink]
25 Feb 2014, 07:57



Go to page
1 2 3 4
Next
[ 63 posts ]



