It is currently 19 Oct 2017, 09:50

Close

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

Close

Request Expert Reply

Confirm Cancel

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

If each participant of a chess tournament plays exactly one

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

1 KUDOS received
Intern
Intern
avatar
Joined: 07 Nov 2012
Posts: 13

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

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

Show Tags

New post 10 Nov 2012, 14:06
1
This post received
KUDOS
5
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  35% (medium)

Question Stats:

73% (01:24) correct 27% (01:43) wrong based on 272 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.

A. 15
B. 16
C. 17
D. 18
E. 19
[Reveal] Spoiler: OA

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

Expert Post
4 KUDOS received
Veritas Prep GMAT Instructor
User avatar
G
Joined: 16 Oct 2010
Posts: 7674

Kudos [?]: 17359 [4], given: 232

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

Show Tags

New post 10 Nov 2012, 19:00
4
This post received
KUDOS
Expert's post
3
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


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)

So n = 18

Answer (D)
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199

Veritas Prep Reviews

Kudos [?]: 17359 [4], given: 232

2 KUDOS received
Intern
Intern
avatar
Joined: 07 Nov 2012
Posts: 13

Kudos [?]: 37 [2], given: 10

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

Show Tags

New post 11 Nov 2012, 01: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?

Kind regards

Derek

Kudos [?]: 37 [2], given: 10

1 KUDOS received
Director
Director
User avatar
Status: Done with formalities.. and back..
Joined: 15 Sep 2012
Posts: 636

Kudos [?]: 653 [1], given: 23

Location: India
Concentration: Strategy, General Management
Schools: Olin - Wash U - Class of 2015
WE: Information Technology (Computer Software)
GMAT ToolKit User Premium Member Reviews Badge
Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

New post 11 Nov 2012, 05: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)
_________________

Lets Kudos!!! ;-)
Black Friday Debrief

Kudos [?]: 653 [1], given: 23

Expert Post
5 KUDOS received
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 41893

Kudos [?]: 128871 [5], given: 12183

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

Show Tags

New post 11 Nov 2012, 05:40
5
This post received
KUDOS
Expert's post
3
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


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\).

Answer: D.

Similar questions to practice:
how-many-diagonals-does-a-polygon-with-21-sides-have-if-one-101540.html
if-10-persons-meet-at-a-reunion-and-each-person-shakes-hands-110622.html
10-business-executives-and-7-chairmen-meet-at-a-conference-126163.html
how-many-different-handshakes-are-possible-if-six-girls-129992.html
15-chess-players-take-part-in-a-tournament-every-player-55939.html
there-are-5-chess-amateurs-playing-in-villa-s-chess-club-127235.html

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?
Extra-hard Quant Tests with Brilliant Analytics

Kudos [?]: 128871 [5], given: 12183

Expert Post
2 KUDOS received
Veritas Prep GMAT Instructor
User avatar
G
Joined: 16 Oct 2010
Posts: 7674

Kudos [?]: 17359 [2], given: 232

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

Show Tags

New post 11 Nov 2012, 19:40
2
This post received
KUDOS
Expert's post
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


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.
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199

Veritas Prep Reviews

Kudos [?]: 17359 [2], given: 232

1 KUDOS received
Senior Manager
Senior Manager
User avatar
Joined: 13 Aug 2012
Posts: 458

Kudos [?]: 541 [1], given: 11

Concentration: Marketing, Finance
GPA: 3.23
GMAT ToolKit User
Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

New post 28 Dec 2012, 06: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.

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


\(\frac{P!}{2!(P-2)!}=153\)
\(\frac{P * (P-1) * (P-2)!}{(P-2)!}=2*9*17\)
\(P*(P-1) = 18*17\)
\(P = 18\)

Answer: D
_________________

Impossible is nothing to God.

Kudos [?]: 541 [1], given: 11

1 KUDOS received
Intern
Intern
avatar
Joined: 05 Jun 2012
Posts: 24

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

WE: Marketing (Retail)
Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

New post 29 Dec 2012, 03: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

Choice D

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

GMAT Club Legend
GMAT Club Legend
User avatar
Joined: 09 Sep 2013
Posts: 16674

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

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

Show Tags

New post 04 Jul 2014, 21: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.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

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

Director
Director
User avatar
G
Joined: 23 Jan 2013
Posts: 601

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

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

Show Tags

New post 01 Oct 2014, 04:32
x!/2!*(x-2)!=153, so

Backsolving looks better:

get C=17
17!/2!*15!=17*16/2=136

go D=18
18!/2!*16!=18*17/2=153 (correct)

D

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

GMAT Club Legend
GMAT Club Legend
User avatar
Joined: 09 Sep 2013
Posts: 16674

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

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

Show Tags

New post 02 Dec 2015, 13: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.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

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

GMAT Club Legend
GMAT Club Legend
User avatar
Joined: 09 Sep 2013
Posts: 16674

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

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

Show Tags

New post 15 Sep 2017, 11: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.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

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

1 KUDOS received
Intern
Intern
avatar
B
Joined: 05 Oct 2016
Posts: 42

Kudos [?]: 4 [1], given: 91

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

Show Tags

New post 15 Sep 2017, 19: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\).

Answer: D.

Similar questions to practice:
http://gmatclub.com/forum/how-many-diag ... 01540.html
http://gmatclub.com/forum/if-10-persons ... 10622.html
http://gmatclub.com/forum/10-business-e ... 26163.html
http://gmatclub.com/forum/how-many-diff ... 29992.html
http://gmatclub.com/forum/15-chess-play ... 55939.html
http://gmatclub.com/forum/there-are-5-c ... 27235.html

Hope it helps.


bunuel how did you simply this equation?

Kudos [?]: 4 [1], given: 91

Intern
Intern
avatar
B
Joined: 26 May 2017
Posts: 23

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

GMAT 1: 620 Q48 V27
If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

New post 15 Sep 2017, 21: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.

Answer D = 18, (18*17 = 306)




Sent from my iPhone using GMAT Club Forum mobile app

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

Intern
Intern
avatar
B
Joined: 05 Oct 2016
Posts: 42

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

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

Show Tags

New post 16 Sep 2017, 15: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.

Answer D = 18, (18*17 = 306)




Sent from my iPhone using GMAT Club Forum mobile app


please simplify the above equation in more steps.

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

Director
Director
avatar
P
Joined: 22 May 2016
Posts: 813

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

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

Show Tags

New post 16 Sep 2017, 16: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.

Answer D = 18, (18*17 = 306)

please simplify the above equation in more steps.

SandhyAvinash , maybe this post will help.

Here are a couple of sites I found that discuss the simplification of factorials with variables. . .

This site is thorough and easy to understand (it cleared up a couple of questions I had):

https://chilimath.com/lessons/intermediate-algebra/simplifying-factorials-with-variables/

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.)

http://www.purplemath.com/modules/factorial.htm

Hope they help!

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.:-)

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

Intern
Intern
avatar
B
Joined: 05 Oct 2016
Posts: 42

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

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

Show Tags

New post 16 Sep 2017, 17:08
Thank you so much. I really appreciate your help sir.

SandhyAvinash

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

Director
Director
avatar
P
Joined: 22 May 2016
Posts: 813

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

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

Show Tags

New post 16 Sep 2017, 17:17
SandhyAvinash wrote:
Thank you so much. I really appreciate your help sir.

SandhyAvinash

You're very welcome. One last thing.

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!

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

Intern
Intern
avatar
B
Joined: 05 Oct 2016
Posts: 42

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

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

Show Tags

New post 17 Sep 2017, 05:45
genxer123 wrote:
SandhyAvinash wrote:
Thank you so much. I really appreciate your help sir.

SandhyAvinash

You're very welcome. One last thing.

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!


Oh thank you i got you :-) genxer123

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

Intern
Intern
User avatar
S
Joined: 25 Jul 2011
Posts: 39

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

Location: India
Concentration: Strategy, Operations
GMAT 1: 710 Q50 V35
GPA: 3.5
WE: Engineering (Energy and Utilities)
CAT Tests
Re: If each participant of a chess tournament plays exactly one [#permalink]

Show Tags

New post 17 Sep 2017, 06: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

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

Re: If each participant of a chess tournament plays exactly one   [#permalink] 17 Sep 2017, 06:52
Display posts from previous: Sort by

If each participant of a chess tournament plays exactly one

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


cron

GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.