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
_________________

Brent Hanneson – Founder of gmatprepnow.com

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

_________________

Register for free sessions
Number Properties | Algebra |Quant Workshop

Success Stories
Guillermo's Success Story | Carrie's Success Story

Ace GMAT quant
Articles and Question to reach Q51 | Question of the week

Must Read Articles
Number Properties – Even Odd | LCM GCD
Word Problems – Percentage 1 | Percentage 2 | Time and Work 1 | Time and Work 2 | Time, Speed and Distance 1 | Time, Speed and Distance 2
Advanced Topics- Permutation and Combination 1 | Permutation and Combination 2 | Permutation and Combination 3 | Probability
Geometry- Triangles 1 | Triangles 2 | Triangles 3 | Common Mistakes in Geometry
Algebra- Wavy line

Practice Questions
Number Properties 1 | Number Properties 2 | Algebra 1 | Geometry | Prime Numbers | Absolute value equations | Sets

| '4 out of Top 5' Instructors on gmatclub | 70 point improvement guarantee | www.e-gmat.com

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

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
_________________

Brent Hanneson – Founder of gmatprepnow.com