Last visit was: 20 Nov 2025, 03:42 It is currently 20 Nov 2025, 03:42
Home
GMAT
Messages
Tests
Schools
Events
Rewards
Chat
My Profile
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.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel
Back to Forum
Create Topic
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,359
 [33]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,359
 [33]
There are n people competing in a chess tournament. Each competitor... 30 Apr 2017, 09:20
4
Kudos
Add Kudos
29
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

55% (hard)

Question Stats:

68% (02:05) correct 32% (01:58) wrong based on 615 sessions

History

Date
Time
Result
Not Attempted Yet
There are n people competing in a chess tournament. Each competitor must play every other competitor k times. If n > 1 and k > 0, what is the total number of games played in the tournament?

A) kn – k
B) (n² – 2k)/2
C) k(n² – n)/2
D) (n² – 2nk + k)/2
E) (kn – 2k)/2

*kudos for all correct solutions
ShowHide Answer
Official Answer
C
Most Helpful Reply
User avatar
EgmatQuantExpert
User avatar
e-GMAT Representative
Joined: 04 Jan 2015
Last visit: 02 Apr 2024
Posts: 3,663
Own Kudos:
20,169
 [12]
Given Kudos: 165
Expert
Expert reply
Posts: 3,663
Kudos: 20,169
 [12]
There are n people competing in a chess tournament. Each competitor... 30 Apr 2017, 10:58
4
Kudos
Add Kudos
8
Bookmarks
Bookmark this Post
GMATPrepNow
There are n people competing in a chess tournament. Each competitor must play every other competitor k times. If n > 1 and k > 0, what is the total number of games played in the tournament?

A) kn – k
B) (n² – 2k)/2
C) k(n² – n)/2
D) (n² – 2nk + k)/2
E) (kn – 2k)/2

*kudos for all correct solutions
Show more


    • If each player plays with each other only once then the total number games is simply given by
      o \(^nC_2 = \frac{n!}{[2!(n-2)!]} = \frac{[n(n-1)]}{2}\)
      o Where n is the number of players and we choose 2 players at a time to play a single game.
    • But then each player is playing its competitor “k” times.
      o Hence the total number of games would be multiplied “k” times.
      o Thus the total number of games = k * Total number of games played once \(= k*n*\frac{(n-1)}{2} = k*\frac{(n^2 – n)}{6}\)
    • Hence the correct answer is Option C.
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,359
 [7]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,359
 [7]
There are n people competing in a chess tournament. Each competitor... 01 May 2017, 06:58
5
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
GMATPrepNow
There are n people competing in a chess tournament. Each competitor must play every other competitor k times. If n > 1 and k > 0, what is the total number of games played in the tournament?

A) kn – k
B) (n² – 2k)/2
C) k(n² – n)/2
D) (n² – 2nk + k)/2
E) (kn – 2k)/2
Show more

Here's an approach that doesn't require any formal counting techniques:

Let's say a MATCH is when two competitors sit down to play their k games against each other.

If we ask each of the n competitors, "How many MATCHES did you have?", the answer will be n-1, since each competitor plays every other competitor, but does not play against him/herself.

So, n(n-1) = the total number of MATCHES

IMPORTANT: There's some duplication here.
For example, when Competitor A says that he/she played n-1 other competitors, this includes the match played against Competitor B. Likewise, when Competitor B says he/she played n-1 other competitors, this includes the match played against Competitor A.

So, in our calculation of n(n-1) = the total number of MATCHES, we included the A vs B match twice.
In fact, we counted every match two times.

To account for this duplication, we'll take n(n-1) and divide by 2 to get n(n-1)/2 MATCHES.

Since each match consists of k games, the total number of games = kn(n-1)/2

Check the answer choices....not there!
However, we can take kn(n-1)/2 and rewrite it as k(n² - n)/2

Answer:
Show Spoiler
C

Cheers,
Brent
General Discussion
User avatar
Kurtosis
User avatar
Current Student
Joined: 13 Apr 2015
Last visit: 10 Nov 2021
Posts: 1,395
Own Kudos:
5,124
 [2]
Given Kudos: 1,228
Location: India
Products:
My Reviews
Posts: 1,395
Kudos: 5,124
 [2]
There are n people competing in a chess tournament. Each competitor... 30 Apr 2017, 09:39
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
If n people play with every other member exactly once (k = 1) then the total number of matches = nC2 = (n(n- 1))/2

If they have to play with each other k times then the total = k(n^2 - n)/2

Answer: C
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,359
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,359
There are n people competing in a chess tournament. Each competitor... 01 May 2017, 06:18
Kudos
Add Kudos
Bookmarks
Bookmark this Post
These are great solutions. There are still a couple of completely different ways to solve this question.
Any takers?

Cheers,
Brent
User avatar
Mo2men
User avatar
Joined: 26 Mar 2013
Last visit: 09 May 2023
Posts: 2,439
Own Kudos:
1,478
 [5]
Given Kudos: 641
Concentration: Operations, Strategy
Schools: Erasmus (II)
Products:
My Reviews
Schools: Erasmus (II)
Posts: 2,439
Kudos: 1,478
 [5]
There are n people competing in a chess tournament. Each competitor... 01 May 2017, 06:21
3
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
GMATPrepNow
There are n people competing in a chess tournament. Each competitor must play every other competitor k times. If n > 1 and k > 0, what is the total number of games played in the tournament?

A) kn – k
B) (n² – 2k)/2
C) k(n² – n)/2
D) (n² – 2nk + k)/2
E) (kn – 2k)/2
Show more

I will do this logically

If I choose 3 teams to meet only 1 round. then total number of games =3

n= 3 & k=1 & total =3

Plug in the answer choices

A) kn – k ..................................3-1=2.............................Eliminate

B) (n² – 2k)/2......................... (9-2)/2.............................Eliminate

C) k(n² – n)/2...........................1 * (9-3)/2=3....................Keep

D) (n² – 2nk + k)/2..................(9-6+1)/2.........................Eliminate

E) (kn – 2k)/2..........................(3-2)/2.............................Eliminate


Answer: C
User avatar
EgmatQuantExpert
User avatar
e-GMAT Representative
Joined: 04 Jan 2015
Last visit: 02 Apr 2024
Posts: 3,663
Own Kudos:
20,169
 [1]
Given Kudos: 165
Expert
Expert reply
Posts: 3,663
Kudos: 20,169
 [1]
There are n people competing in a chess tournament. Each competitor... 01 May 2017, 06:41
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
GMATPrepNow
There are n people competing in a chess tournament. Each competitor must play every other competitor k times. If n > 1 and k > 0, what is the total number of games played in the tournament?

A) kn – k
B) (n² – 2k)/2
C) k(n² – n)/2
D) (n² – 2nk + k)/2
E) (kn – 2k)/2

*kudos for all correct solutions
Show more

Let me assume a student who does not know how to use permutation and combination and yet he wants to solve this questions.

He can use a bit of logic and hit and trial to get the answer.

So suppose if I consider, N = 2 and k = 2, the number of games played should be 2 ( easy to visualize, A and B are two people, they play matches 2 times)

    A) kn – k = 4 - 2 = 2
    B) (n² – 2k)/2 = 4 -4/2 = 0 = Not possible
    C) k(n² – n)/2 = 2.2/2 = 2
    D) (n² – 2nk + k)/2 = 4 - 8 +2/2 = negative = Not Possilbe
    E) (kn – 2k)/2 = 4- 4/2 = 0 Not possible

Now we are left with, Option A and C.

    Take N = 3 and k = 1, if there are three people A, B, C, the matches they can play are AB, BC and AC i.e. three matches.

A. 1.3 - 1 = 2 Not possible
C. 1.(9-3)2/ = 3 Hence C has to be the answer.


Thanks,
Saquib
Quant Expert
e-GMAT

Register for our Free Session on Number Properties (held every 3rd week) to solve exciting 700+ Level Questions in a classroom environment under the real-time guidance of our Experts :)

avatar
storm1327
avatar
Joined: 05 Jun 2014
Last visit: 19 Nov 2018
Posts: 8
Own Kudos:
5
Given Kudos: 108
Posts: 8
Kudos: 5
There are n people competing in a chess tournament. Each competitor... 25 Oct 2017, 23:49
Kudos
Add Kudos
Bookmarks
Bookmark this Post
EgmatQuantExpert
GMATPrepNow
There are n people competing in a chess tournament. Each competitor must play every other competitor k times. If n > 1 and k > 0, what is the total number of games played in the tournament?

A) kn – k
B) (n² – 2k)/2
C) k(n² – n)/2
D) (n² – 2nk + k)/2
E) (kn – 2k)/2

*kudos for all correct solutions


    • If each player plays with each other only once then the total number games is simply given by
      o \(^nC_2 = \frac{n!}{[2!(n-2)!]} = \frac{[n(n-1)]}{2}\)
      o Where n is the number of players and we choose 2 players at a time to play a single game.
    • But then each player is playing its competitor “k” times.
      o Hence the total number of games would be multiplied “k” times.
      o Thus the total number of games = k * Total number of games played once \(= k*n*\frac{(n-1)}{2} = k*\frac{(n^2 – n)}{6}\)
    • Hence the correct answer is Option C.
Show more

shouldn't the answer be \(k*\frac{(n^2 – n)}{2}\) and not \(k*\frac{(n^2 – n)}{6}\)
I assume this to be a typo :)
User avatar
luisdicampo
User avatar
Joined: 10 Feb 2025
Last visit: 20 Nov 2025
Posts: 5
Given Kudos: 217
Posts: 5
Kudos: 0
There are n people competing in a chess tournament. Each competitor... 19 Nov 2025, 02:18
Kudos
Add Kudos
Bookmarks
Bookmark this Post
EgmatQuantExpert



    • If each player plays with each other only once then the total number games is simply given by
    • o \(^nC_2 = \frac{n!}{[2!(n-2)!]} = \frac{[n(n-1)]}{2}\)o Where n is the number of players and we choose 2 players at a time to play a single game.
    • But then each player is playing its competitor “k” times.

  • o Hence the total number of games would be multiplied “k” times.
    o Thus the total number of games = k * Total number of games played once \(= k*n*\frac{(n-1)}{2} = k*\frac{(n^2 – n)}{6}\)
    • Hence the correct answer is Option C.
Show more
/2 not 6, thanks by the way, very helpful!
Moderators:
Bunuel
Math Expert
105408 posts
Krunaal
Tuck School Moderator
805 posts