There are red gloves and white gloves in David’s drawer only. It is known that there are at most 2019 gloves in his drawer, the number of red gloves is more than the number of white gloves and if he randomly picks 2 gloves from his drawer, the probability for getting the same colour is . Find the highest possible number of the number of red gloves.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let r be the number of red gloves and w the number of white gloves, with r > w and r + w = N ≤ 2 0 1 9 . The scenario of picking two red gloves in a row or two white gloves in a row translates to the equation
N r × N − 1 r − 1 + N w × N − 1 w − 1 = 2 1 .
But if the probability of getting the same colour gloves is 1 / 2 , then the probability of getting different coloured gloves is also 1 / 2 , and thus the scenario of picking a red glove followed by a white glove or a white glove followed by a red glove translates to the equation
N r × N − 1 w + N w × N − 1 r = 2 1 .
Comparing these equations gives us that
r ( r − 1 ) + w ( w − 1 ) = 2 r w ⟹ r 2 − r + w 2 − w = 2 r w ⟹ r 2 − 2 r w + w 2 = r + w ⟹ ( r − w ) 2 = r + w .
Now as r + w ≤ 2 0 1 9 and since 4 4 2 < 2 0 1 9 < 4 5 2 the maximum value for r − w is 4 4 , in which case r + w = 4 4 2 = 1 9 3 6 , and so
( r − w ) + ( r + w ) = 4 4 + 1 9 3 6 ⟹ 2 r = 1 9 8 0 ⟹ r = 9 9 0 , w = 9 9 0 − 4 4 = 9 4 6 .
Note that maximizing r − w results in maximizing r + w , which in turn results in maximizing r , and so the desired answer is 9 9 0 .