Difference between revisions of "1985 AIME Problems/Problem 14"

Latest revision as of 21:14, 18 June 2020

Problem

In a tournament each player played exactly one game against each of the other players. In each game the winner was awarded $1$ point, the loser got $0$ points, and each of the two players earned $\frac{1}{2}$ point if the game was a tie. After the completion of the tournament, it was found that exactly half of the points earned by each player were earned against the ten players with the least number of points. (In particular, each of the ten lowest scoring players earned half of her/his points against the other nine of the ten). What was the total number of players in the tournament?

Solution 1

Let us suppose for convenience that there were $n + 10$ players overall. Among the $n$ players not in the weakest 10 there were $n \choose 2$ games played and thus $n \choose 2$ points earned. By the givens, this means that these $n$ players also earned $n \choose 2$ points against our weakest 10. Now, the 10 weakest players playing amongst themselves played ${10 \choose 2} = 45$ games and so earned 45 points playing each other. Then they also earned 45 points playing against the stronger $n$ players. Since every point earned falls into one of these categories, It follows that the total number of points earned was $2{n \choose 2} + 90 = n^2 - n + 90$ . However, there was one point earned per game, and there were a total of ${n + 10 \choose 2} = \frac{(n + 10)(n + 9)}{2}$ games played and thus $\frac{(n + 10)(n + 9)}{2}$ points earned. So we have $n^2 -n + 90 = \frac{(n + 10)(n + 9)}{2}$ so $2n^2 - 2n + 180 = n^2 + 19n + 90$ and $n^2 -21n + 90 = 0$ and $n = 6$ or $n = 15$ . Now, note that the top $n$ players got $n(n - 1)$ points in total (by our previous calculation) for an average of $n - 1$ , while the bottom 10 got 90 points total, for an average of 9. Thus we must have $n > 10$ , so $n = 15$ and the answer is $15 + 10 = \boxed{25}$ .

Solution 2

Suppose that there are $n$ players participating in the tournament. We break this up into a group of the weakest ten, and the other $n-10$ people. Note that the $10$ players who played each other generated a total of $\dbinom{10}{2} = 45$ points playing each other. Thus, they earned $45$ playing the $n-10$ other people. Thus, the $n-10$ people earned a total of $10(n-10)-45 = 10n-145$ points playing vs. this group of 10 people, and also earned a total of $10n-145$ playing against themselves. Since each match gives a total of one point, we must have that $\dbinom{n-10}{2}=10n-145$ . Expanding and simplifying gives us $n^2-41n+400=0$ . Thus, $n=16$ or $n=25$ . Note however that if $n=16$ , then the strongest $16$ people get a total of $16*10-145=15$ playing against the weakest $10$ who gained $45$ points vs them, which is a contradiction since it must be larger. Thus, $n=\boxed{25}$ .

Solution by GameMaster402

Solution 3

Note that the total number of points accumulated must sum to ${p \choose 2} = \frac{p(p-1)}{2}$ . Say the number of people is $n$ . Consider the number of points gained when the 10 lowest scoring people play each other. The problem tells us that each of these 10 people must earn exactly half of the total number of points they will earn during the whole game. This implies that this group of 10 people must accumulate half their total combined points after they (the 10 people) all play each other, meaning they must earn the other half of their points by playing the $n-10$ stronger players. The problem also tells us that the $n-10$ people who aren't part of the losers group will earn half of their points by playing the $10$ losers. Since the $n-10$ group and $10$ losers will earn half their points by playing each other, the sum of the number of points that they gain playing each other must then be half of the total amount of points earned by everyone in the game. Therefore, $\frac{p(p-1)}{4} = 10(p-10)$ . This equation is the same as above, and by the same logic, the answer is $n=\boxed{25}$ .

@@ Line 2: / Line 2: @@
 In a tournament each player played exactly one game against each of the other players. In each game the winner was awarded <math>1</math> point, the loser got <math>0</math> points, and each of the two players earned <math>\frac{1}{2}</math> point if the game was a tie. After the completion of the tournament, it was found that exactly half of the points earned by each player were earned against the ten players with the least number of points. (In particular, each of the ten lowest scoring players earned half of her/his points against the other nine of the ten). What was the total number of players in the tournament?
-== Solution ==
+== Solution 1==
-Let us suppose for convenience that there were <math>n + 10</math> players overall.  Among the <math>n</math> players not in the weakest 10 there were <math>n \choose 2</math> games played and thus <math>n \choose 2</math> points earned.  By the givens, this means that these <math>n</math> players also earned <math>n \choose 2</math> points against our weakest 10.  Now, the 10 weakest players playing amongst themselves played <math>{10 \choose 2} = 45</math> games and so earned 45 points playing each other.  Then they also earned 45 points playing against the stronger <math>n</math> players.  Since every point earned falls into one of these categories, It follows that the total number of points earned was <math>2{n \choose 2} + 90 = n^2 - n + 90</math>.  However, there was one point earned per game, and there were a total of <math>{n + 10 \choose 2} = \frac{(n + 10)(n + 9)}{2}</math> games played and thus <math>\frac{(n + 10)(n + 9)}{2}</math> points earned.  So we have <math>n^2 -n + 90 = \frac{(n + 10)(n + 9)}{2}</math> so <math>2n^2 - 2n + 180 = n^2 + 19n + 90</math> and <math>n^2 -21n + 90 = 0</math> and <math>n = 6</math> or <math>n = 15</math>.  Now, note that the top <math>n</math> players got <math>n(n - 1)</math> points in total (by our previous calculation) for an average of <math>n - 1</math>, while the bottom 10 got 90 points total, for an average of 9.  Thus we must have <math>n > 10</math>, so <math>n = 15</math> and the answer is <math>15 + 10 = \boxed{025}</math>.
+Let us suppose for convenience that there were <math>n + 10</math> players overall.  Among the <math>n</math> players not in the weakest 10 there were <math>n \choose 2</math> games played and thus <math>n \choose 2</math> points earned.  By the givens, this means that these <math>n</math> players also earned <math>n \choose 2</math> points against our weakest 10.  Now, the 10 weakest players playing amongst themselves played <math>{10 \choose 2} = 45</math> games and so earned 45 points playing each other.  Then they also earned 45 points playing against the stronger <math>n</math> players.  Since every point earned falls into one of these categories, It follows that the total number of points earned was <math>2{n \choose 2} + 90 = n^2 - n + 90</math>.  However, there was one point earned per game, and there were a total of <math>{n + 10 \choose 2} = \frac{(n + 10)(n + 9)}{2}</math> games played and thus <math>\frac{(n + 10)(n + 9)}{2}</math> points earned.  So we have <math>n^2 -n + 90 = \frac{(n + 10)(n + 9)}{2}</math> so <math>2n^2 - 2n + 180 = n^2 + 19n + 90</math> and <math>n^2 -21n + 90 = 0</math> and <math>n = 6</math> or <math>n = 15</math>.  Now, note that the top <math>n</math> players got <math>n(n - 1)</math> points in total (by our previous calculation) for an average of <math>n - 1</math>, while the bottom 10 got 90 points total, for an average of 9.  Thus we must have <math>n > 10</math>, so <math>n = 15</math> and the answer is <math>15 + 10 = \boxed{25}</math>.
+== Solution 2 ==
+Suppose that there are <math>n</math> players participating in the tournament. We break this up into a group of the weakest ten, and the other <math>n-10</math> people. Note that the <math>10</math> players who played each other generated a total of <math>\dbinom{10}{2} = 45</math> points playing each other. Thus, they earned <math>45</math> playing the <math>n-10</math> other people. Thus, the <math>n-10</math> people earned a total of <math>10(n-10)-45 = 10n-145</math> points playing vs. this group of 10 people, and also earned a total of <math>10n-145</math> playing against themselves. Since each match gives a total of one point, we must have that <math>\dbinom{n-10}{2}=10n-145</math>. Expanding and simplifying gives us <math>n^2-41n+400=0</math>. Thus, <math>n=16</math> or <math>n=25</math>. Note however that if <math>n=16</math>, then the strongest <math>16</math> people get a total of <math>16*10-145=15</math> playing against the weakest <math>10</math> who gained <math>45</math> points vs them, which is a contradiction since it must be larger. Thus, <math>n=\boxed{25}</math>.
+Solution by GameMaster402
+== Solution 3 ==
+Note that the total number of points accumulated must sum to <math>{p \choose 2} = \frac{p(p-1)}{2}</math>. Say the number of people is <math>n</math>. Consider the number of points gained when the 10 lowest scoring people play each other. The problem tells us that each of these 10 people must earn exactly half of the total number of points they will earn during the whole game. This implies that this group of 10 people must accumulate half their total combined points after they (the 10 people) all play each other, meaning they must earn the other half of their points by playing the <math>n-10</math> stronger players. The problem also tells us that the <math>n-10</math> people who aren't part of the losers group will earn half of their points by playing the <math>10</math> losers.  Since the <math>n-10</math> group and <math>10</math> losers will earn half their points by playing each other, the sum of the number of points that they gain playing each other must then be half of the total amount of points earned by everyone in the game. Therefore, <math>\frac{p(p-1)}{4} = 10(p-10)</math>. This equation is the same as above, and by the same logic, the answer is <math>n=\boxed{25}</math>.
 == See also ==
 {{AIME box|year=1985|num-b=13|num-a=15}}

1985 AIME (Problems • Answer Key • Resources)
Preceded by Problem 13	Followed by Problem 15
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search