Last visit was: 23 Apr 2024, 14:12 It is currently 23 Apr 2024, 14:12

Close

GRE Prep Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GRE score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Close

Request Expert Reply

Confirm Cancel
Retired Moderator
Joined: 10 Apr 2015
Posts: 6218
Own Kudos [?]: 11679 [17]
Given Kudos: 136
Send PM
Most Helpful Community Reply
Retired Moderator
Joined: 10 Apr 2015
Posts: 6218
Own Kudos [?]: 11679 [5]
Given Kudos: 136
Send PM
General Discussion
avatar
Retired Moderator
Joined: 20 Apr 2016
Posts: 1307
Own Kudos [?]: 2214 [5]
Given Kudos: 251
WE:Engineering (Energy and Utilities)
Send PM
avatar
Intern
Intern
Joined: 03 Sep 2018
Posts: 10
Own Kudos [?]: 22 [3]
Given Kudos: 0
Send PM
Re: TRICKY! There are n teams playing in a basketball tournam [#permalink]
3
I’m no expert , this method I feel is not optimised

Trick lies in the statement exactly 1 win or loss.

Therefore , no of losses = no of wins ..............(1)

*n(n - 1)/2 = no of matches played , solving options we get C equals 110 , therefore each team will play a total of 10 matches

Since it is given that 4 teams lost exactly 5 games , thus, we have (4*5) 20 losses and to compensate these losses we have 20 wins

Similarly, 5 teams won exactly 3 games , we have (5*3) 15 wins and (5*7) 35 losses

No of losses = 55
No of wins = 35

Now, rest of the teams won all the games and not a single game was lost so total losses equals 55 . Therefore , 20 must be added to no of wins to make both the above quantities equal.

Therefore answer is 55 i.e option C
avatar
Retired Moderator
Joined: 20 Apr 2016
Posts: 1307
Own Kudos [?]: 2214 [0]
Given Kudos: 251
WE:Engineering (Energy and Utilities)
Send PM
Re: TRICKY! There are n teams playing in a basketball tournam [#permalink]
1
nomomuffins wrote:
*n(n - 1)/2 = no of matches played , solving options we get C equals 110 , therefore each team will play a total of 10 matches




Can you plz check how you got 10 after solving, I believe it should be 11
avatar
Intern
Intern
Joined: 03 Sep 2018
Posts: 10
Own Kudos [?]: 22 [0]
Given Kudos: 0
Send PM
Re: TRICKY! There are n teams playing in a basketball tournam [#permalink]
1
pranab01 wrote:
nomomuffins wrote:
*n(n - 1)/2 = no of matches played , solving options we get C equals 110 , therefore each team will play a total of 10 matches




Can you plz check how you got 10 after solving, I believe it should be 11


Total 11 teams , each team plays only one match with other , therefore each team plays a total of 10 matches

And thus 11*10=110 matches in all
avatar
Retired Moderator
Joined: 20 Apr 2016
Posts: 1307
Own Kudos [?]: 2214 [1]
Given Kudos: 251
WE:Engineering (Energy and Utilities)
Send PM
Re: TRICKY! There are n teams playing in a basketball tournam [#permalink]
1
Bookmarks
nomomuffins wrote:

Total 11 teams , each team plays only one match with other , therefore each team plays a total of 10 matches

And thus 11*10=110 matches in all


Right, just got skipped :)
avatar
Intern
Intern
Joined: 11 Oct 2022
Posts: 2
Own Kudos [?]: 6 [2]
Given Kudos: 14
Send PM
Re: TRICKY! There are n teams playing in a basketball tournam [#permalink]
2
I think there is a flaw in the argument of those reasoning for no of teams = 11.
There are two important statements given:
(1) "each team plays every other team once"
(2) "each of the remaining teams won all of its games"
Then, it is logically necessary that we add only one team to the 9 teams already mentioned. Because if we added two new teams, they would also have to play against each other, and one of them would lose. Hence, if each of the remaining teams won all of their games, there can only be one remaining team. Only one team can win all of their games!
avatar
Intern
Intern
Joined: 30 Nov 2022
Posts: 1
Own Kudos [?]: 1 [1]
Given Kudos: 1
Send PM
TRICKY! There are n teams playing in a basketball tournam [#permalink]
1
This question is impossible as posed.

Say N is the total number of teams, A refers to the 5 '3 wins' teams, and B refers to the 4 '5 losses' teams. Also note # of wins must equal # of losses, bc each win comes with a loss, and there can only ever be 1 remaining team if they are to win all their games, bc 2+ teams can't play all the other teams and win them all.

Case 1 - N <= 8: This is impossible because if A and B overlap (some A teams have also lost 5), the total games they played = 8, but there aren't 8 other teams to play. if N <= 8 (Games played per team = N - 1)

Case 2 - N = 9: Assume no remaining teams, so set A and B don't overlap. Games played by each team = N-1 = 8, so Set A would have lost 5 of their 8 if they won 3, but that means more than 4 lost 5 games. Assume 1 remaining team, the same problem above results.

Case 3: - N = 10: Note there can only be 1 remaining team, so this is the last case. The table looks like this
#: 1 2 3 4 5 6 7 8 9 10
L: 5 5 5 5 x x x x x 0
W: y y y y 3 3 3 3 3 9

x = 6, and y = 4. bc they each played 9 games. Total wins = 4(4)+5(3) +9 = 40, and total losses = 4(5) + 5(6) + 0 = 50. Doesn't work.

Thus, the problem is impossible
avatar
Intern
Intern
Joined: 25 Feb 2023
Posts: 1
Own Kudos [?]: 0 [0]
Given Kudos: 2
Send PM
Re: TRICKY! There are n teams playing in a basketball tournam [#permalink]
pranab223 wrote:
Case 3 : each of the remaining teams won all of its games
So the no. of games won = N * (N-1)(N - 9)

I think you made a small mistake in the explanation here. The number of games won should just be = (N-1)(N-9) correct?
Prep Club for GRE Bot
[#permalink]
Moderators:
Moderator
1085 posts
GRE Instructor
218 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne