Difference between revisions of "2023 AMC 8 Problems/Problem 8"
(→Solution) |
(→Problem) |
||
| Line 5: | Line 5: | ||
<cmath>\begin{tabular}{c | c} Player & Result \\ \hline Lola & \texttt{111011}\\ Lolo & \texttt{101010}\\ Tiya & \texttt{010100}\\ Tiyo & \texttt{??????} \end{tabular}</cmath> | <cmath>\begin{tabular}{c | c} Player & Result \\ \hline Lola & \texttt{111011}\\ Lolo & \texttt{101010}\\ Tiya & \texttt{010100}\\ Tiyo & \texttt{??????} \end{tabular}</cmath> | ||
<math>\textbf{(A)}\ \texttt{000101} \qquad \textbf{(B)}\ \texttt{001001} \qquad \textbf{(C)}\ \texttt{010000} \qquad \textbf{(D)}\ \texttt{010101} \qquad \textbf{(E)}\ \texttt{011000}</math> | <math>\textbf{(A)}\ \texttt{000101} \qquad \textbf{(B)}\ \texttt{001001} \qquad \textbf{(C)}\ \texttt{010000} \qquad \textbf{(D)}\ \texttt{010101} \qquad \textbf{(E)}\ \texttt{011000}</math> | ||
| + | |||
| + | |||
| + | == Solution == | ||
| + | |||
| + | We can calculate the total number of wins (1's) by seeing how many matches were playes, which are 12 matches played. Then we can calculate the # of wins already on the table, which is 5 + 3 + 2 = 10 so there are 12 - 10 = 2 wins left in the mystery player. Now we will make the key observation that there are only 2 1's per column as there are 2 winners and 2 losers in each round. Strategically looking through the colums counting the 1's and putting our own 2 1's when the column isn't already full yields <math>\boxed{\textbf{(A)}\ \texttt{000101}}</math> | ||
| + | |||
| + | ~SohumUttamchandani | ||
== Solution == | == Solution == | ||
Revision as of 19:52, 24 January 2023
Problem
Lola, Lolo, Tiya, and Tiyo participated in a ping pong tournament. Each player competed against each of the other three players exactly twice. Shown below are the win-loss records for the players. The numbers 
and 
represent a win or loss, respectively. For example, Lola won five matches and lost the fourth match. What was Tiyo’s win-loss record?
![\[\begin{tabular}{c | c} Player & Result \\ \hline Lola & \texttt{111011}\\ Lolo & \texttt{101010}\\ Tiya & \texttt{010100}\\ Tiyo & \texttt{??????} \end{tabular}\]](http://latex.artofproblemsolving.com/c/1/0/c108a299c4eace651f02848c15ca7a646f6adff0.png)
Solution
We can calculate the total number of wins (1's) by seeing how many matches were playes, which are 12 matches played. Then we can calculate the # of wins already on the table, which is 5 + 3 + 2 = 10 so there are 12 - 10 = 2 wins left in the mystery player. Now we will make the key observation that there are only 2 1's per column as there are 2 winners and 2 losers in each round. Strategically looking through the colums counting the 1's and putting our own 2 1's when the column isn't already full yields 
~SohumUttamchandani
Solution
In total, there will be 
games because there are 
ways to choose a pair of people from the four players and each player will play each other player exactly twice. Each of these 
games will have winner and loser, so there will be a total of 's and 's in the win-loss table. Therefore, Tiyo will have 
's and 
's in his record.
Now, all we have to do is figure out the order of these 's and 's. Clearly, in every round, there are two games; the players are split into two pairs and the people in those pairs play each other. Thus, every round should have 
winners and losers which means that every column of the win-loss table should have 's and 's. Looking at the filled-in table so far, we see that columns 
and 
need one more , so Tiyo must have 's in those columns and 's go in the others.
Therefore, our answer is 
~lpieleanu
