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

Redeem

Players in a tournament

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
Legendary Member
Posts: 1132
Joined: Mon Jul 20, 2009 3:38 am
Location: India
Thanked: 64 times
Followed by:6 members
GMAT Score:760

Players in a tournament

by harsh.champ » Sun Feb 07, 2010 7:30 am
In a tournament, there are n teams T1 , T2 ....., T with n > 5. Each team consists of k players, k > 3. The following pairs of teams have one player in common:
T1 & T2 , T2 & T3 ,......, Tn − 1 & Tn , and Tn & T1.
No other pair of teams has any player in common. How many players are participating in the tournament, considering all the n teams together?]

(A)n(k - 1)
(B)k(n - 1)
(C)n(k - 2)
(D)k(k - 2)
(E)(n - 1)(k - 1)

The ans. is A.
Seeking help regarding problem approach!!
It takes time and effort to explain, so if my comment helped you please press Thanks button :)



Just because something is hard doesn't mean you shouldn't try,it means you should just try harder.

"Keep Walking" - Johnny Walker :P
Top
Source: — Problem Solving |
User avatar
Legendary Member
Posts: 1022
Joined: Mon Jul 20, 2009 11:49 pm
Location: Gandhinagar
Thanked: 41 times
Followed by:2 members

by shashank.ism » Sun Feb 07, 2010 7:31 am
harsh.champ wrote:In a tournament, there are n teams T1 , T2 ....., T with n > 5. Each team consists of k players, k > 3. The following pairs of teams have one player in common:
T1 & T2 , T2 & T3 ,......, Tn − 1 & Tn , and Tn & T1.
No other pair of teams has any player in common. How many players are participating in the tournament, considering all the n teams together?]

(A)n(k - 1)
(B)k(n - 1)
(C)n(k - 2)
(D)k(k - 2)
(E)(n - 1)(k - 1)

The ans. is A.
Seeking help regarding problem approach!!
The total no. of teams = n
The total no. of players in each team = k
Now without any boundation total no. of players = nk
now total no. of common players = n (T1-T2, T2-T3,...............Tn-T1)

SO TOTAL NO. OF PLAYERS WITH GIVEN CONDITION = nk -n = [spoiler]n(k-1)[/spoiler]

The ans. is A.
My Websites:
www.mba.webmaggu.com - India's social Network for MBA Aspirants

www.deal.webmaggu.com -India's online discount, coupon, free stuff informer.

www.dictionary.webmaggu.com - A compact free online dictionary with images.

Nothing is Impossible, even Impossible says I'm possible.
Top
User avatar
Legendary Member
Posts: 1275
Joined: Thu Sep 21, 2006 11:13 pm
Location: Arabian Sea
Thanked: 125 times
Followed by:2 members

by ajith » Sun Feb 07, 2010 8:09 am
harsh.champ wrote:In a tournament, there are n teams T1 , T2 ....., T with n > 5. Each team consists of k players, k > 3. The following pairs of teams have one player in common:
T1 & T2 , T2 & T3 ,......, Tn − 1 & Tn , and Tn & T1.
No other pair of teams has any player in common. How many players are participating in the tournament, considering all the n teams together?]

(A)n(k - 1)
(B)k(n - 1)
(C)n(k - 2)
(D)k(k - 2)
(E)(n - 1)(k - 1)

The ans. is A.
Seeking help regarding problem approach!!
There are n teams and each team has k players
The number of players if there were no sharing = n*k
No of players shared = n

Total no of players with sharing = nk -n = n(k-1)
A
Always borrow money from a pessimist, he doesn't expect to be paid back.
Top
User avatar
Newbie | Next Rank: 10 Posts
Posts: 1
Joined: Fri Apr 27, 2012 9:36 am

by Raju602 » Fri Apr 27, 2012 9:40 am
Anyone got answer?
Top
User avatar
GMAT Instructor
Posts: 3225
Joined: Tue Jan 08, 2008 2:40 pm
Location: Toronto
Thanked: 1710 times
Followed by:614 members
GMAT Score:800

by Stuart@KaplanGMAT » Fri Apr 27, 2012 10:56 am
harsh.champ wrote:In a tournament, there are n teams T1 , T2 ....., T with n > 5. Each team consists of k players, k > 3. The following pairs of teams have one player in common:
T1 & T2 , T2 & T3 ,......, Tn − 1 & Tn , and Tn & T1.
No other pair of teams has any player in common. How many players are participating in the tournament, considering all the n teams together?]

(A)n(k - 1)
(B)k(n - 1)
(C)n(k - 2)
(D)k(k - 2)
(E)(n - 1)(k - 1)
Hi!

We have variables in the choices, so we can definitely pick numbers to solve this problem.

Let's pick the smallest numbers we can to keep the question manageable: 6 teams and 4 players per team.

Now let's write out our teams, in accordance with the rules:

1: ABCD
2: DEFG
3: GHIJ
4: JKLM
5: MNOP
6: PQRA

We've gone from letter A to R, so that's 18 different players.

Finally, sub in n=6 and k=4 into the choices:

A) 6(3) = 18
B) 4(5) = 20
C) 6(2) = 12
D) 4(2) = 8
E) 5(3) = 10

Only (A) gives us 18 players... done!
Image

Stuart Kovinsky | Kaplan GMAT Faculty | Toronto

Kaplan Exclusive: The Official Test Day Experience | Ready to Take a Free Practice Test? | Kaplan/Beat the GMAT Member Discount
BTG100 for $100 off a full course
Top
Senior | Next Rank: 100 Posts
Posts: 82
Joined: Fri Nov 04, 2011 12:35 am
Followed by:2 members

by amit28it » Sat Apr 28, 2012 12:17 am
The solution provided by harsh.champ is great and correct but a bit complicated to understand,I want to ask if there is any kind of simple solution anyone can give.
calculus problem solver
Top
Post new topic Post Reply
• Page 1 of 1