1991 AIME Problems/Problem 13
A drawer contains a mixture of red socks and blue socks, at most in all. It so happens that, when two socks are selected randomly without replacement, there is a probability of exactly that both are red or both are blue. What is the largest possible number of red socks in the drawer that is consistent with this data?
Let and denote the number of red and blue socks, respectively. Also, let . The probability that when two socks are drawn randomly, without replacement, both are red or both are blue is given by
Solving the resulting quadratic equation , for in terms of , one obtains that
Now, since and are positive integers, it must be the case that , with . Hence, would correspond to the general solution. For the present case , and so one easily finds that is the largest possible integer satisfying the problem conditions.
In summary, the solution is that the maximum number of red socks is .
Let and denote the number of red and blue socks such that . Then by complementary counting, the number of ways to get a red and a blue sock must be equal to , so must be a perfect square . Clearly, , so the larger , the larger : is the largest perfect square below , and our answer is .
Let and denote the number of red and blue socks, respectively. In addition, let , the total number of socks in the drawer.
From the problem, it is clear that
Expanding, we get
Substituting for and cross multiplying, we get
Combining terms, we get
To make this expression factorable, we add to both sides, resulting in
From this equation, we can test values for the expression , which is the multiplication of two consecutive integers, until we find the highest value of or such that .
By testing and , we get that and . Testing values one integer higher, we get that and . Since is greater than , we conclude that is our answer.
Since it doesn't matter whether the number of blue or red socks is , we take the higher value for , thus the maximum number of red socks is .
As above, let , , and denote the number of red socks, the number of blue socks, and the total number of socks, respectively. We see that , so .
Seeing that we can rewrite as , and remembering that , we have , so , which equals .
We now have , so and . Adding this to , we have . To maximize , we must use the positive square root and maximize . The largest possible value of is the largest perfect square less than 1991, which is . Therefore, .
Solution by Zeroman
Let be the number of socks that are red, and be the total number of socks. We get:
Expanding the left hand side and the right hand side, we get:
And, moving terms, we will get that:
We notice that the left side is a perfect square.
Thus is a perfect square. And, the higher is, the higher will be. So, we should set
And, we see, We will use the positive root, to get that , , and .
|1991 AIME (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|