Difference between revisions of "1991 AIME Problems/Problem 13"
m |
Gabiloncho (talk | contribs) |
||
Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
− | + | Let <math>r</math> and <math>b</math> denote the number of red and blue socks, respectively. Also, let <math>t=r+b</math>. | |
== See also == | == See also == | ||
{{AIME box|year=1991|num-b=12|num-a=14}} | {{AIME box|year=1991|num-b=12|num-a=14}} |
Revision as of 17:51, 18 April 2007
Problem
A drawer contains a mixture of red socks and blue socks, at most 1991 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?
Solution
Let and denote the number of red and blue socks, respectively. Also, let .
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 |