BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

A certain league

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Master | Next Rank: 500 Posts
Posts: 435
Joined: Wed Nov 16, 2011 7:27 am
Thanked: 48 times
Followed by:16 members

A certain league

by alex.gellatly » Sun Sep 02, 2012 7:07 pm
There are 8 teams in a certain league and each team plays each of the other teams exactly once. If each game is played by 2 teams, what is the total number of games played?

15
16
28
56
64

[spoiler]OK I know how to solve this problem, but I don't understand why MGMAT's slot method doesn't work here. I normally use the P or C formulas to solve these types of problems, but recently I've been trying the slot approach....am I missing something here..[/spoiler]

Thanks
A useful website I found that has every quant OG video explanation:

https://www.beatthegmat.com/useful-websi ... tml#475231
Top
Source: — Problem Solving |
Legendary Member
Posts: 1084
Joined: Fri Apr 15, 2011 2:33 pm
Thanked: 158 times
Followed by:21 members

by pemdas » Sun Sep 02, 2012 8:46 pm
it's 8C2=28 or slot-wise one team 8 options and another 7 options. Adjusting for one game, cancelling ordered arrangement and leaving only combination 8*7/2!=28
Success doesn't come overnight!
Top

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 2623
Joined: Mon Jun 02, 2008 3:17 am
Location: Montreal
Thanked: 1090 times
Followed by:355 members
GMAT Score:780

by Ian Stewart » Sun Sep 02, 2012 11:02 pm
alex.gellatly wrote: OK I know how to solve this problem, but I don't understand why MGMAT's slot method doesn't work here.
That method doesn't belong to any particular company. :)

The first question to ask yourself when counting is whether order matters. If it does, you can just use slots. If it doesn't, you can't just use slots - you'll need to account for the fact that order doesn't matter somehow. There are a few ways people learn to do this. You can use slots, and then at the end just divide by k! where k is your number of slots. Or you can use an nCk formula if you prefer, but there will always be an extra step if order doesn't matter.

In this question, order does not matter: "Chicago against New York" would be the same game as "New York against Chicago". So you can use slots as a starting point, but then because order doesn't matter, you will need to divide by 2! = 2 at the end. Here we'd have 8 choices for the first team in the game, and 7 choices for the second, so if order mattered, the answer would be 8*7. Since order doesn't matter, we need to divide by 2!, so we get 8*7/2! = 28 games.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com

ianstewartgmat.com
Top
User avatar
Newbie | Next Rank: 10 Posts
Posts: 1
Joined: Mon Jul 30, 2012 2:30 pm
Location: India

by talk2taran » Tue Sep 04, 2012 1:48 am
principle of counting can do the job :idea:

Match is played between 2 teams say _v/s _. Number of choices to fill the 1st dash are 8, which leaves us with 7 options for 2nd dash. so number of possible matches 8*7= 56
Now notice that in these 56 matches,say 2 teams (A and B) have played with each other twice. So divide by 2.

so final answer 56/2= 28 B-)
Best regards,
Taran
Top
Post new topic Post Reply
• Page 1 of 1