Last visit was: 14 Jul 2025, 01:37 It is currently 14 Jul 2025, 01:37
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
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 13 May 2024
Posts: 6,755
Own Kudos:
34,075
 [24]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,755
Kudos: 34,075
 [24]
4
Kudos
Add Kudos
20
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
EgmatQuantExpert
User avatar
e-GMAT Representative
Joined: 04 Jan 2015
Last visit: 02 Apr 2024
Posts: 3,681
Own Kudos:
19,447
 [10]
Given Kudos: 165
Expert
Expert reply
Posts: 3,681
Kudos: 19,447
 [10]
3
Kudos
Add Kudos
7
Bookmarks
Bookmark this Post
User avatar
Mo2men
Joined: 26 Mar 2013
Last visit: 09 May 2023
Posts: 2,443
Own Kudos:
1,438
 [5]
Given Kudos: 641
Concentration: Operations, Strategy
Schools: Erasmus (II)
Products:
Schools: Erasmus (II)
Posts: 2,443
Kudos: 1,438
 [5]
3
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
General Discussion
User avatar
Kurtosis
User avatar
Current Student
Joined: 13 Apr 2015
Last visit: 10 Nov 2021
Posts: 1,400
Own Kudos:
4,978
 [2]
Given Kudos: 1,228
Location: India
Products:
Posts: 1,400
Kudos: 4,978
 [2]
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: 13 May 2024
Posts: 6,755
Own Kudos:
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,755
Kudos: 34,075
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
EgmatQuantExpert
User avatar
e-GMAT Representative
Joined: 04 Jan 2015
Last visit: 02 Apr 2024
Posts: 3,681
Own Kudos:
19,447
 [1]
Given Kudos: 165
Expert
Expert reply
Posts: 3,681
Kudos: 19,447
 [1]
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

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

User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 13 May 2024
Posts: 6,755
Own Kudos:
34,075
 [5]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,755
Kudos: 34,075
 [5]
3
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

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:
Cheers,
Brent
avatar
storm1327
Joined: 05 Jun 2014
Last visit: 19 Nov 2018
Posts: 8
Own Kudos:
Given Kudos: 108
Posts: 8
Kudos: 5
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.

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
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 37,377
Own Kudos:
Posts: 37,377
Kudos: 1,010
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
Moderators:
Math Expert
102569 posts
PS Forum Moderator
691 posts