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