Difference between revisions of "1991 AIME Problems/Problem 13"
MRENTHUSIASM (talk | contribs) m (→Solution) |
|||
(One intermediate revision by the same user not shown) | |||
Line 72: | Line 72: | ||
- AlexLikeMath | - AlexLikeMath | ||
+ | |||
+ | ==Solution 6== | ||
+ | Let <math>r</math> and <math>b</math> denote the red socks and blue socks, respectively. Thus the equation in question is: | ||
+ | |||
+ | <math>\frac{r(r-1)+b(b-1)}{(r+b)(r+b-1)}=\frac{1}{2}</math> | ||
+ | |||
+ | <math>\Rightarrow 2r^2-2r+2b^2-2b=r^2+2rb+b^2-r-b</math> | ||
+ | |||
+ | <math>\Rightarrow r^2+b^2-r-b-2rb=0</math> | ||
+ | |||
+ | <math>\Rightarrow (r-b)^2=r+b\le 1991</math> | ||
+ | |||
+ | Because we wish to maximize <math>r</math>, we have <math>r\ge b</math> and thus <math>r-b\le 44</math> as both <math>r</math> and <math>b</math> must be integers and <math>{44}^2=1936</math> is the largest square less than or equal to <math>1991</math>. We now know that the maximum difference between the number of socks is <math>44</math>. Now we return to an earlier equation: | ||
+ | |||
+ | <math>r^2+b^2-r-b-2rb=0</math> | ||
+ | |||
+ | <math>\Rightarrow r^2-(2b+1)r+(b^2-b)=0</math> | ||
+ | |||
+ | Solving by the [[Quadratic formula]], we have: | ||
+ | |||
+ | <math>r=\frac{2b+1\pm\sqrt{4b^2+4b+1-4b^2+4b}}{2}</math> | ||
+ | |||
+ | <math>\Rightarrow r=\frac{2b+1\pm\sqrt{8b+1}}{2}</math> | ||
+ | |||
+ | <math>\Rightarrow r-b=\frac{1\pm\sqrt{8b+1}}{2}</math> | ||
+ | |||
+ | <math>\Rightarrow 44\ge r-b=\frac{1\pm\sqrt{8b+1}}{2}</math> | ||
+ | |||
+ | <math>\Rightarrow 44\ge\frac{1\pm\sqrt{8b+1}}{2}</math> | ||
+ | |||
+ | <math>\Rightarrow \pm\sqrt{8b+1}\le 87</math> | ||
+ | |||
+ | <math>\Rightarrow b\le 946</math> (Here we use the positive sign to maximize <math>r</math>.) | ||
+ | |||
+ | Thus the optimal case would be <math>b=946</math> as <math>r</math> increases only when <math>b</math> increases. In addition, <math>\sqrt{8b+1}=87</math> as we are using the equality case. We then plug back in: | ||
+ | |||
+ | <math>r=\frac{2b+1\pm\sqrt{8b+1}}{2}</math> | ||
+ | |||
+ | <math>\Rightarrow r=\frac{1893+87}{2}</math> (using the established <math>\sqrt{8b+1}=87</math>) | ||
+ | |||
+ | <math>\Rightarrow r=\frac{1980}{2}</math> | ||
+ | |||
+ | <math>\Rightarrow r=\boxed{990}</math> | ||
+ | |||
+ | ~eevee9406 | ||
== See also == | == See also == |
Latest revision as of 20:24, 5 February 2024
Contents
Problem
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?
Solutions
Solution 1
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 .
Solution 2
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
.
Solution 3
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 lower value for
, thus the maximum number of red socks is
.
Solution 4
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
Solution 5
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
.
- AlexLikeMath
Solution 6
Let and
denote the red socks and blue socks, respectively. Thus the equation in question is:
Because we wish to maximize , we have
and thus
as both
and
must be integers and
is the largest square less than or equal to
. We now know that the maximum difference between the number of socks is
. Now we return to an earlier equation:
Solving by the Quadratic formula, we have:
(Here we use the positive sign to maximize
.)
Thus the optimal case would be as
increases only when
increases. In addition,
as we are using the equality case. We then plug back in:
(using the established
)
~eevee9406
See also
1991 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 12 |
Followed by Problem 14 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.