Author 
Message 
TAGS:

Hide Tags

Intern
Joined: 14 Feb 2013
Posts: 31

256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
28 Apr 2013, 07:07
Question Stats:
71% (01:07) correct 29% (01:11) wrong based on 399 sessions
HideShow timer Statistics
256 teams play in a state soccer tournament. A team is eliminated from the tournament after one loss. In the first round, all 256 teams play one game. If a team wins, it advances to the next round, where it plays another winning team. This process repeats itself until only one team is left, having advanced through each round without losing. How many games are played in the tournament? A. 255 B. 256 C. \(\frac{256!}{(254!)(2!)(2!)}\) D. \(\frac{256!}{(254!)(2!)}\) E. \(\frac{256!}{254!}\)
Official Answer and Stats are available only to registered users. Register/ Login.
_________________
Consider giving +1 Kudo when my post helps you. Also, Good Questions deserve Kudos..!




Tutor
Joined: 20 Apr 2012
Posts: 99
Location: Ukraine
GMAT 1: 690 Q51 V31 GMAT 2: 730 Q51 V38
WE: Education (Education)

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
28 Apr 2013, 07:33
In order to one team to win, all other teams should lose. So we can calculate the number of games as the number of teamlosers. There are 255 such teams. The answer should be A. P.S. If course you can calculate as sum of 128 games in first round, 64 in second, 32 in third, 16 in fourth, 8 in fifth, 4 in sixth, 2 in seventh, and 1 in eights. Still you get the same answer A. But not so fast.
_________________
I'm happy, if I make math for you slightly clearer And yes, I like kudos:)




Intern
Joined: 12 Apr 2013
Posts: 8

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
Updated on: 28 Apr 2013, 07:36
Hi my friends, this is my solution to this problem in round 1, there's \(2^8\) teams with \(2^7\) games are played. and then in round 2, there's \(2^7\) teams left wiht \(2^6\) games are played in the last round, there's \(2\) teams left with 1 game are played so the games that is played is \(A=2^7+2^6+...+2+1\) we must find the value of A we have \(2.A=2^8+2^7+...^2^2+2\) and then \(2.AA=(2^8+2^7+...+2^2+2)(2^7+2^6+...+2+1)=2^81\) so we have \(A=2^81=255\) The answer is A My friends, I think if you want to solve this problem fast, you should know that \(256=2^8\)
_________________
Life is not easy I knew that and now I don't even expect life to be easy



Tutor
Joined: 20 Apr 2012
Posts: 99
Location: Ukraine
GMAT 1: 690 Q51 V31 GMAT 2: 730 Q51 V38
WE: Education (Education)

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
28 Apr 2013, 07:42
The most beautiful thing in this problem that you don't need to do any calculations. The answer will be always the number if teams1.
_________________
I'm happy, if I make math for you slightly clearer And yes, I like kudos:)



Intern
Joined: 12 Apr 2013
Posts: 8

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
28 Apr 2013, 07:49
smyarga wrote: The most beautiful thing in this problem that you don't need to do any calculations. The answer will be always the number if teams1. Yes, after solving this problem as I posted above, I think that if you have \(2^n\) teams, there's will always be \(2^n1\) games played smyarga, please explain to me more clearly why there's 255 losers so we will have 255 games played. I think your solution is much faster and more clever than mine.
_________________
Life is not easy I knew that and now I don't even expect life to be easy



Tutor
Joined: 20 Apr 2012
Posts: 99
Location: Ukraine
GMAT 1: 690 Q51 V31 GMAT 2: 730 Q51 V38
WE: Education (Education)

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
28 Apr 2013, 08:01
retailingvnsupernova wrote: smyarga wrote: The most beautiful thing in this problem that you don't need to do any calculations. The answer will be always the number if teams1. Yes, after solving this problem as I posted above, I think that if you have \(2^n\) teams, there's will always be \(2^n1\) games played smyarga, please explain to me more clearly why there's 255 losers so we will have 255 games played. I think your solution is much faster and more clever than mine. With pleasure. Every game has exactly one loser. To calculate the number of games is the same as calculate the number of losers. Every team except the winner loses only one game. So the number of games is the number of teams except the winner. Hope this helps.
_________________
I'm happy, if I make math for you slightly clearer And yes, I like kudos:)



Intern
Joined: 12 Apr 2013
Posts: 8

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
28 Apr 2013, 08:08
smyarga wrote: Every game has exactly one loser. To calculate the number of games is the same as calculate the number of losers. Every team except the winner loses only one game. So the number of games is the number of teams except the winner. Hope this helps. oh my god, my brain is too lazy Thank you ^^
_________________
Life is not easy I knew that and now I don't even expect life to be easy



Intern
Joined: 14 Feb 2013
Posts: 31

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
28 Apr 2013, 11:05
smyarga wrote: In order to one team to win, all other teams should lose. So we can calculate the number of games as the number of teamlosers. There are 255 such teams. The answer should be A.
P.S. If course you can calculate as sum of 128 games in first round, 64 in second, 32 in third, 16 in fourth, 8 in fifth, 4 in sixth, 2 in seventh, and 1 in eights. Still you get the same answer A. But not so fast. i was over thinking this problem, thanks for explaining a quick and easy method..
_________________
Consider giving +1 Kudo when my post helps you. Also, Good Questions deserve Kudos..!



Intern
Joined: 05 Feb 2013
Posts: 27
Location: Ukraine

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
08 May 2013, 00:30
We have simple set of geometrical progression with first element 128 (128 pairs = 256). We have 8 rounds to final game, so A number of games (formula of sum for n elements of geometrical progression ) = (128* (q^81))/0,51 = (128*(10,0625)(1+0,0625))/0,5 = First Impression that answer is 256, but you should look for slightly different answer such as 255 Where q step of geometrical progression = 0,5!



Intern
Joined: 16 Apr 2015
Posts: 2
Concentration: Technology, Technology
WE: Information Technology (Computer Software)

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
18 Sep 2016, 12:37
I followed the inputs for 8 teams and concluded that for 8 teams it will take 7 games similarly for 256 teams it will take 255 games
_________________
Raunaq



Senior Manager
Joined: 29 Jun 2017
Posts: 497
GPA: 4
WE: Engineering (Transportation)

Re: 256 teams play in a state soccer tournament. A team is elimi [#permalink]
Show Tags
12 Jan 2018, 01:05
lets say 3 teams A B and C AB match => A wins AC match => C wins overall winner is C => Matches played AB and AC => 31 => n1 if n teams So => 256 teams 255 is the answer.
_________________
Give Kudos for correct answer and/or if you like the solution.




Re: 256 teams play in a state soccer tournament. A team is elimi
[#permalink]
12 Jan 2018, 01:05






