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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

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:

If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

10 Nov 2012, 13:06

1

This post received KUDOS

6

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

35% (medium)

Question Stats:

73% (01:24) correct 27% (01:42) wrong based on 285 sessions

HideShow timer Statistics

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

A. 15 B. 16 C. 17 D. 18 E. 19

We are basically told that we can choose 153 groups of two players out of n players, thus \(C^2_n=153\) --> \(\frac{n!}{(n-2)!2!}=153\) --> \(\frac{(n-1)n}{2}=153\) --> \((n-1)n=306\) --> \(n=18\).

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

A. 15 B. 16 C. 17 D. 18 E. 19

If the number of participants is 3 (say A, B, C) the number of games played will be 2 (A plays against B and C) + 1 (B plays against C) = 3 Using the same logic, if the number of participants is n, the number of games played will be (n-1) + (n - 2) + (n - 3) + ... 3 + 2 + 1

Given that this sum = 153 = 1 + 2 + 3 + ... ( n - 1)

Sum of first m positive integers is given by m(m+1)/2. So sum of first (n-1) positive integers is (n-1)*n/2

153 = (n-1)*n/2 (n-1)*n = 306 17*18 = 306 (We know that 15^2 = 225 so the two consecutive numbers must be greater than 15. Also, 20^2 = 400 so the two numbers must be less than 20. The pair of numbers in between 15 and 20 whose product ends with 6 is 17 and 18)

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

11 Nov 2012, 00:29

2

This post received KUDOS

Thanks Karishma

I must admit I am struggling to work through your solution. I looked at the question again and answered it with the approach of working through each of the choices long-hand.

If A, then 15 players means they each will play 14 games (so 14*15), divide the result by two for double counted games: 14*15 = 210 201/2 = 105, not 153, next

If B, 15*16 = 240 240/2 = 120, not 153, next

If C, 16*17 = 274 274/2 = 137, not 153, next

If D, 17*18 = 306 306/2 = 153 ANSWER D

Am I missing any important concepts by answering the question with this long-hand method as opposed to your more structured approach?

I must admit I am struggling to work through your solution. I looked at the question again and answered it with the approach of working through each of the choices long-hand.

If A, then 15 players means they each will play 14 games (so 14*15), divide the result by two for double counted games: 14*15 = 210 201/2 = 105, not 153, next

If B, 15*16 = 240 240/2 = 120, not 153, next

If C, 16*17 = 274 274/2 = 137, not 153, next

If D, 17*18 = 306 306/2 = 153 ANSWER D

Am I missing any important concepts by answering the question with this long-hand method as opposed to your more structured approach?

Kind regards

Derek

Your method is absolutely fine. Your logic of multiplying n players by (n-1) games and dividing by 2 is great. The issue with your approach is that you need to calculate for every option. If the numbers were a little larger, you would end up doing calculations a number of times. For each option, you are doing this calculation (n-1)*n/2 (A) 14*15/2 (B) 15*16/2 etc You are trying to find the option that will give you the result 153. I have done the same thing. I get (n-1)*n/2 = 153. Instead of trying all options, you should multiply 153 by 2 to get 306 and then see which two numbers will end in 6. That way you will save a lot of calculations.

14*15 - No 15*16 - No 16*17 - No 17*18 - Yes 18*19 - No

As for the approach used by me to arrive at n*(n-1)/2: Think of it this way - you make all participants stand in a straight line. The first one comes up and play a game with everyone else i.e. (n-1) games and goes away. The next one comes up and plays a game with all remaining people i.e. (n-2) people and goes away too. This goes on till last two people are left and one comes up, play a game against the other and they both go away. Hence, they end up playing (n-1) + (n - 2) + .... 3 + 2 + 1 games (total number of games)

You must learn that sum of first m positive integers is given by m(m+1)/2 (very useful to know this) We need to sum first (n-1) numbers so their sum will be (n-1)n/2

Bunuel has used the combinatorics approach to arrive at n(n-1)/2. There are n people and you want to select as many distinct two people teams as you can (since each person can play against the other only once) In how many ways can you do that? nC2 ways nC2 = n(n-1)/2

So the calculation involved is the same in every case. The method of arriving at the equation is different.
_________________

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

11 Nov 2012, 04:07

1

This post received KUDOS

derekgmat wrote:

Thanks Karishma

I must admit I am struggling to work through your solution. I looked at the question again and answered it with the approach of working through each of the choices long-hand.

If A, then 15 players means they each will play 14 games (so 14*15), divide the result by two for double counted games: 14*15 = 210 201/2 = 105, not 153, next

If B, 15*16 = 240 240/2 = 120, not 153, next

If C, 16*17 = 274 274/2 = 137, not 153, next

If D, 17*18 = 306 306/2 = 153 ANSWER D

Am I missing any important concepts by answering the question with this long-hand method as opposed to your more structured approach?

Kind regards

Derek

both are actually doing the same thing. You approach is a logical one while Karishma's is a structured one. But eventually both are doing same thing: n*(n-1)/2 = 153 ( or 17*18/2 =153)
_________________

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

28 Dec 2012, 05:32

1

This post received KUDOS

derekgmat wrote:

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

29 Dec 2012, 02:59

1

This post received KUDOS

derekgmat wrote:

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

A. 15 B. 16 C. 17 D. 18 E. 19

Num of games - 153, The total number of players that can be chosen as a pair would be nC2.

Now look through the options & start form the middle number as the options are in ascending order - 17C2 = 17*16/2 = 6 as last digit (17 *8) ignore Next number 18c2 = 18*17/2 = 3 as last digit this is the answer

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

15 Sep 2017, 18:49

1

This post received KUDOS

Bunuel wrote:

derekgmat wrote:

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

A. 15 B. 16 C. 17 D. 18 E. 19

We are basically told that we can choose 153 groups of two players out of n players, thus \(C^2_n=153\) --> \(\frac{n!}{(n-2)!2!}=153\) --> \(\frac{(n-1)n}{2}=153\) --> \((n-1)n=306\) --> \(n=18\).

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

04 Jul 2014, 20:46

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

02 Dec 2015, 12:09

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

15 Sep 2017, 10:15

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

15 Sep 2017, 20:36

derekgmat wrote:

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

A. 15 B. 16 C. 17 D. 18 E. 19

You can also approach the question with combinations.

Let's say there are n people playing chess. You need to select 2 people from n people.

Number of ways of doing that is nC2 = n!/(n-2)!2!

Reducing the above equation you get n(n-1)/2 number of ways.

Now, n(n-1)/2 = 153 --> n(n-1) = 306

Try different options that fit the criteria. Quick method is to notice that the multiplication of n * n-1 should give a units digit of 6.

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

16 Sep 2017, 14:34

craveyourave wrote:

derekgmat wrote:

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

A. 15 B. 16 C. 17 D. 18 E. 19

You can also approach the question with combinations.

Let's say there are n people playing chess. You need to select 2 people from n people.

Number of ways of doing that is nC2 = n!/(n-2)!2!

Reducing the above equation you get n(n-1)/2 number of ways.

Now, n(n-1)/2 = 153 --> n(n-1) = 306

Try different options that fit the criteria. Quick method is to notice that the multiplication of n * n-1 should give a units digit of 6.

If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

16 Sep 2017, 15:45

SandhyAvinash wrote:

craveyourave wrote:

derekgmat wrote:

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

A. 15 B. 16 C. 17 D. 18 E. 19

You can also approach the question with combinations.

Let's say there are n people playing chess. You need to select 2 people from n people.

Number of ways of doing that is nC2 = n!/(n-2)!2!

Reducing the above equation you get n(n-1)/2 number of ways.

Now, n(n-1)/2 = 153 --> n(n-1) = 306

Try different options that fit the criteria. Quick method is to notice that the multiplication of n * n-1 should give a units digit of 6.

This next site's treatment is shorter than that above, but I have seen experts link to this site. (Experts may have linked to chilimath as well. I just haven't seen it. I ran the math as it was explained on chilimath. The math seems fine.)

P.S. I think questions here work better if you type the symbol @ before the username in your post. The name will show up in blue, like this SandhyAvinash.

If the person follows topics via email, s/he will get notified. S/he will not get notified with just SandhyAvinash, for example.

When you "flag" someone by typing the @ symbol, use it before THEIR name (not yours). All these rules can get confusing. You are very polite, which I appreciate. Cheers!

When you "flag" someone by typing the @ symbol, use it before THEIR name (not yours). All these rules can get confusing. You are very polite, which I appreciate. Cheers!

Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

17 Sep 2017, 05:52

1

This post was BOOKMARKED

derekgmat wrote:

If each participant of a chess tournament plays exactly one game with each of the remaining participants, then 153 games will be played during the tournament. Find the number of participants.

A. 15 B. 16 C. 17 D. 18 E. 19

It's a 10 second problem once you understand that the question is simply asking if nC2=153 then what is the value of n?

consider only 2 players; A and B then no of matches "If each participant of a chess tournament plays exactly one game with each of the remaining participants"=1 (A vs B) as any particular match involves 2 players here..because each player plays against each of the remaining participants separately... so we only have to select 2 players...a simple combination.. to count a possible match from amongst the available players...

If there are 2 players only...then selecting 2 out of 2=2C2=1 (AB) if there are 3 players only....then selecting 2 out of 3=3C2=3 (AB,AC,BC) if there are 4 players only....then selecting 2 out of 4=4C2=6 (AB,AC,AD,BC,BD,CD) Similarly... if there are n players only....then selecting 2 out of n=nC2=n!/2!(n-2)!

here..nC2=n!/2!(n-2)!=153...put values back from options..we get n=18

Further....had a match involved 3 players rather than 2....then the no. of matches would have been nC3... i.e., selecting 3 out of n players to play a match.

Similarly....had a match involved 4 players rather than 2....then the no. of matches would have been nC4... i.e., selecting 4 out of n players to play a match.

Thus, had a match involved r players rather than 2....then the no. of matches would have been nCr... i.e., selecting r out of n players to play a match....

If each participant of a chess tournament plays exactly 2 game with each of the remaining participants=just multiply nC2 with 2..
_________________

Please hit kudos button below if you found my post helpful..TIA