Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 28 Jun 2016, 19:51

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# A researcher plans to identify each participant in a certain

Author Message
TAGS:

### Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 33547
Followers: 5944

Kudos [?]: 73760 [1] , given: 9903

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

25 Nov 2013, 04:41
1
KUDOS
Expert's post
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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

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.
_________________
Director
Status: Verbal Forum Moderator
Joined: 17 Apr 2013
Posts: 635
Location: India
GMAT 1: 710 Q50 V36
GMAT 2: 750 Q51 V41
GMAT 3: 790 Q51 V49
GPA: 3.3
Followers: 43

Kudos [?]: 294 [0], given: 297

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

25 Nov 2013, 04:47
Lets take A B C D
A
B
C
D
AB
AC
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: how-to-score-750-and-750-i-moved-from-710-to-189016.html

Math Expert
Joined: 02 Sep 2009
Posts: 33547
Followers: 5944

Kudos [?]: 73760 [0], given: 9903

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

25 Nov 2013, 04:51
Expert's post
honchos wrote:
Lets take A B C D
A
B
C
D
AB
AC
BC
BD
CD
ABC
BCA
CBA

It is alphabetical and all letter for a particular codes are different.

Please read the question carefully. The stem says that a code can consists of 1 or 2 letters ONLY: a code consists of either a single letter or a pair of distinct letters written in alphabetical order.
_________________
Manager
Joined: 05 Nov 2012
Posts: 172
Followers: 1

Kudos [?]: 27 [0], given: 57

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

25 Nov 2013, 09:39
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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

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?

Intern
Joined: 10 Nov 2013
Posts: 20
Location: United States
Concentration: Healthcare, Strategy
WE: Information Technology (Health Care)
Followers: 1

Kudos [?]: 10 [1] , given: 130

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

29 Nov 2013, 20:18
1
KUDOS
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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

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?

The question specifically points out that the combinations can be a 1 digit letter or a 2 digit letter.
I used a simple combination as stated in other answers to find out.

1. A
2. B
3. BA
4. C
5. CA
6. CB
7. D
8. DA
9. DB
10. DC
11. E
12. EA

STOP. you get the answer as 5 (ABCDE)
Also what i have found is that when writing down the combinations with no repeats, it is easier to start with one letter and keep repeating it until you exhausted all the options. this will eliminate confusion. like you start with C and repeat with CA CB and then with D DA DB DC..
Intern
Joined: 20 Nov 2013
Posts: 32
Schools: LBS '17
Followers: 0

Kudos [?]: 12 [0], given: 189

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

25 Feb 2014, 08: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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

I have a questions here:
How did we get from $$n(n+1)\geq{24}$$ to $$n_{min}=5$$
Math Expert
Joined: 02 Sep 2009
Posts: 33547
Followers: 5944

Kudos [?]: 73760 [0], given: 9903

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

25 Feb 2014, 09:39
Expert's post
amz14 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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

I have a questions here:
How did we get from $$n(n+1)\geq{24}$$ to $$n_{min}=5$$

By trial and error:
If n=4, then n(n+1)=20<24;
If n=5, then n(n+1)=30>24.

Hence, $$n_{min}=5$$.

Try similar questions to practice: a-researcher-plans-to-identify-each-participant-in-a-certain-134584.html#p1296049

Hope this helps.
_________________
Intern
Joined: 16 Feb 2014
Posts: 1
Followers: 0

Kudos [?]: 0 [0], given: 0

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

13 Mar 2014, 15:03
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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

I am still having problems with this question. Why do we devide the combinations formula into n(n-1)/2?
Shouldnt it be 2!/n!(2-n)! ?
Math Expert
Joined: 02 Sep 2009
Posts: 33547
Followers: 5944

Kudos [?]: 73760 [2] , given: 9903

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

14 Mar 2014, 02:48
2
KUDOS
Expert's post
1
This post was
BOOKMARKED
RebekaMo 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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

I am still having problems with this question. Why do we devide the combinations formula into n(n-1)/2?
Shouldnt it be 2!/n!(2-n)! ?

$$C^2_n=\frac{n!}{2!(n-2)!}$$. Now, notice that $$n!=(n-2)!*(n-1)*n$$, hence $$C^2_n=\frac{n!}{2!(n-2)!}=\frac{(n-2)!*(n-1)*n}{2!(n-2)!}=\frac{(n-1)n}{2}$$.

Hope it's clear.
_________________
Senior Manager
Joined: 15 Aug 2013
Posts: 328
Followers: 0

Kudos [?]: 38 [0], given: 23

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

06 Apr 2014, 12: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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

Probability and Combinatorics are my weakest subjects by far, so please ignore the rudimentary question.

When we say $$C^2_n+n\geq{12}$$ that means that we are going to find a combination of 2 letters out of a group of n letters which in turn would yield "x" amount of options. Correct? If so, why are we adding the n following that equation and more importantly, how does that equation yield 5? When I factor it out, i get n(n+1) >= 24. That yields -1 and 0. Why am I so off here?

My question would be - what does this formula mean and how do you solve it? $$C^2_n+n\geq{12}$$

Also, the question is saying that they need to be in alphabetical order, doesn't that mean that order DOES matter? How does that affect the above equation.

P.S: For what it's worth, I've read the Combinatorics and Probability strategy guide(Manhattan Gmat) and understand the content of the guide but these two topics still elude me. I'm open to learning from another venue if helpful?

EDIT: Simplifying my question.
Math Expert
Joined: 02 Sep 2009
Posts: 33547
Followers: 5944

Kudos [?]: 73760 [0], given: 9903

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

06 Apr 2014, 13:09
Expert's post
russ9 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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

Probability and Combinatorics are my weakest subjects by far, so please ignore the rudimentary question.

When we say $$C^2_n+n\geq{12}$$ that means that a combination of 2 letters out of a group of n letters should yield "x" amount of options. Correct? If so, why are we adding the n following that equation and more importantly, how does that equation yield 5? When I factor it out, i get n(n+1) >= 24. That yields -1 and 0. Why am I so off here?

Also, the question is saying that they need to be in alphabetical order, doesn't that mean that order DOES matter? How does that affect the above equation.

P.S: For what it's worth, I've read the Combinatorics and Probability strategy guide and understand the content of the guide but these two topics still elude me. I'm open to learning from another venue if helpful?

The question says that the code can consists of 1 or 2 letters. Now, if we have n letters how many codes we can make?

The # of single letter codes possible would be n itself;
The # of pair of distinct letters codes possible would be $$C^2_n$$.

So, out of n letters we can make $$n+C^2_n$$ codes: n one-letter codes and $$C^2_n$$ two-letter codes.

How the equation yields 5

By trial and error:
If n=4, then n(n+1)=20<24;
If n=5, then n(n+1)=30>24.

Hence, $$n_{min}=5$$.

Notice that we have $$n(n+1)\geq{24}$$ NOT $$n(n+1)\geq{0}$$.

Check here: a-researcher-plans-to-identify-each-participant-in-a-certain-134584.html#p1150091 and here: a-researcher-plans-to-identify-each-participant-in-a-certain-134584.html#p1296053

Similar questions to practice:
each-student-at-a-certain-university-is-given-a-four-charact-151945.html
all-of-the-stocks-on-the-over-the-counter-market-are-126630.html
if-a-code-word-is-defined-to-be-a-sequence-of-different-126652.html
a-4-letter-code-word-consists-of-letters-a-b-and-c-if-the-59065.html
a-5-digit-code-consists-of-one-number-digit-chosen-from-132263.html
a-company-that-ships-boxes-to-a-total-of-12-distribution-95946.html
a-company-plans-to-assign-identification-numbers-to-its-empl-69248.html
the-security-gate-at-a-storage-facility-requires-a-five-109932.html
all-of-the-bonds-on-a-certain-exchange-are-designated-by-a-150820.html
a-local-bank-that-has-15-branches-uses-a-two-digit-code-to-98109.html
a-researcher-plans-to-identify-each-participant-in-a-certain-134584.html
baker-s-dozen-128782-20.html#p1057502
in-a-certain-appliance-store-each-model-of-television-is-136646.html
m04q29-color-coding-70074.html
john-has-12-clients-and-he-wants-to-use-color-coding-to-iden-107307.html
how-many-4-digit-even-numbers-do-not-use-any-digit-more-than-101874.html
a-certain-stock-exchange-designates-each-stock-with-a-85831.html
the-simplastic-language-has-only-2-unique-values-and-105845.html
m04q29-color-coding-70074.html

Hope this helps.
_________________
Senior Manager
Joined: 15 Aug 2013
Posts: 328
Followers: 0

Kudos [?]: 38 [0], given: 23

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

06 Apr 2014, 13:48
Hi Bunuel,

Thanks for the clarification. I was having a hard time grasping the equation itself but I followed a link to the mathbook topic and that does a good job of explaining why the equation is the way it is.

What I do question is the arrangement of the letters. I did go to the two links you posted and it's still a little unclear. How does the 2Cn equation know to not double count BA and AB. Wouldn't we have to go to the permutation equation for that?
Math Expert
Joined: 02 Sep 2009
Posts: 33547
Followers: 5944

Kudos [?]: 73760 [0], given: 9903

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

06 Apr 2014, 13:58
Expert's post
russ9 wrote:
Hi Bunuel,

Thanks for the clarification. I was having a hard time grasping the equation itself but I followed a link to the mathbook topic and that does a good job of explaining why the equation is the way it is.

What I do question is the arrangement of the letters. I did go to the two links you posted and it's still a little unclear. How does the 2Cn equation know to not double count BA and AB. Wouldn't we have to go to the permutation equation for that?

Apart from that link I can only advice you to check it yourself. How many 2-letter words in alphabetical order are possible from say 3 letters {a, b, c}.
_________________
Intern
Joined: 19 Jan 2014
Posts: 31
Followers: 0

Kudos [?]: 14 [0], given: 51

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

15 May 2014, 14:53
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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

I just don't understand how we get n(n-1)/2 out of nC2... Isn't it n!/(n-2)! ? Combinations are the worst part of GMAT for me.
Math Expert
Joined: 02 Sep 2009
Posts: 33547
Followers: 5944

Kudos [?]: 73760 [0], given: 9903

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

16 May 2014, 01:43
Expert's post
bytatia 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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

I just don't understand how we get n(n-1)/2 out of nC2... Isn't it n!/(n-2)! ? Combinations are the worst part of GMAT for me.

Hope it helps.
_________________
Intern
Joined: 24 Sep 2013
Posts: 3
GMAT 1: 200 Q0 V0
Followers: 0

Kudos [?]: 0 [0], given: 4

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

18 May 2014, 00:24
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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

Every time I see your explanation, problem becomes so easy, but when I tried my own, I hardly get the correct. How to improve my understanding on combination and Probability ?
Math Expert
Joined: 02 Sep 2009
Posts: 33547
Followers: 5944

Kudos [?]: 73760 [0], given: 9903

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

18 May 2014, 01:07
Expert's post
1
This post was
BOOKMARKED
gauravsaxena21 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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

Every time I see your explanation, problem becomes so easy, but when I tried my own, I hardly get the correct. How to improve my understanding on combination and Probability ?

By studying theory and practicing.

Theory on Combinations: math-combinatorics-87345.html

DS questions on Combinations: search.php?search_id=tag&tag_id=31
PS questions on Combinations: search.php?search_id=tag&tag_id=52

Tough and tricky questions on Combinations: hardest-area-questions-probability-and-combinations-101361.html

Theory on probability problems: math-probability-87244.html

All DS probability problems to practice: search.php?search_id=tag&tag_id=33
All PS probability problems to practice: search.php?search_id=tag&tag_id=54

Tough probability questions: hardest-area-questions-probability-and-combinations-101361.html

Hope this helps.
_________________
Intern
Joined: 11 Jun 2013
Posts: 3
Followers: 0

Kudos [?]: 0 [0], given: 2

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

13 Aug 2014, 17:49
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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

Thanks Bunuel for the explanation.
I do need some clarification regarding the C(n,r).
How does C(n, 2) = n(n-1)/2?
Shouldn't it be n! / (2! (n - 2)!)

Thank you!
Math Expert
Joined: 02 Sep 2009
Posts: 33547
Followers: 5944

Kudos [?]: 73760 [1] , given: 9903

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

14 Aug 2014, 00:54
1
KUDOS
Expert's post
ccyang24 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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

Thanks Bunuel for the explanation.
I do need some clarification regarding the C(n,r).
How does C(n, 2) = n(n-1)/2?
Shouldn't it be n! / (2! (n - 2)!)

Thank you!

Hope it helps.
_________________
Intern
Joined: 10 Jul 2014
Posts: 5
Followers: 0

Kudos [?]: 0 [0], given: 16

Re: A researcher plans to identify each participant in a certain [#permalink]

### Show Tags

02 Sep 2014, 18:53
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(n-1)}{2}+n\geq{12}$$ --> $$n(n-1)+2n\geq{24}$$ --> $$n(n+1)\geq{24}$$ --> $$n_{min}=5$$.

Hope it's clear.

I don't get how this is B instead of D. Aside from the formula, it says in alphabetical order, so how can you count AC, etc.?
Re: A researcher plans to identify each participant in a certain   [#permalink] 02 Sep 2014, 18:53

Go to page   Previous    1   2   3   4    Next  [ 69 posts ]

Similar topics Replies Last post
Similar
Topics:
2 Of the twelve participants in a certain competition 3 05 Feb 2014, 13:04
22 A certain research group plans to create computer models of 18 09 Sep 2013, 10:59
21 If each participant of a chess tournament plays exactly one 10 10 Nov 2012, 14:06
Each participant in a certain study was assigned a sequence 6 27 May 2010, 11:30
2 A researcher plans to identify each participant in a certain 9 17 Nov 2006, 11:07
Display posts from previous: Sort by