A drawer contains n socks. If you randomly draw socks, without replacement, the probability that they are both blue is What is the smallest possible value of blue socks?
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 there be b blue socks out of the n total socks. Then the probability of drawing two blue socks is n b × n − 1 b − 1 = 2 6 5 . Thus 2 6 b ( b − 1 ) = 5 n ( n − 1 ) . Consider this as a quadratic in terms of b : 2 6 b 2 − 2 6 b − 5 n ( n − 1 ) = 0 the solutions to this equation are b = 2 ⋅ 2 6 2 6 ± 2 6 2 + 4 ⋅ 2 6 ⋅ 5 n ( n − 1 ) = 2 1 ± 2 1 2 6 2 2 6 2 + 4 ⋅ 2 6 ⋅ 5 n ( n − 1 ) = 2 1 ± 2 1 1 3 1 3 + 2 ⋅ 5 n ( n − 1 ) = 2 1 ± 2 1 3 1 1 0 n 2 − 1 0 n + 1 3
Note, first, that we can ignore the − option of the ± since it will yield a solution less than one. Since our solution must be an integer, we need a positive integer value of n for which 1 0 n 2 − 1 0 n + 1 3 = 1 3 k 2 , where k is odd, in which case the last line of the equation becomes 2 1 + 2 k . Our answer will be for the smallest possible value of k .
k = 1 1 0 n 2 − 1 0 n + 1 3 1 0 n ( n − 1 ) = 1 3 = 0 n = 0 or n = 1 -- not solutions.
k = 3 1 0 n 2 − 1 0 n + 1 3 1 0 n 2 − 1 0 n − 1 6 4 = 1 7 7 = 0 No integer solutions.
k = 5 1 0 n 2 − 1 0 n + 1 3 1 0 n 2 − 1 0 n − 3 1 2 = 3 2 5 = 0 No integer solutions.
Continuing in this manner, the first k for which there are integer solutions is k = 1 1 , in which case we have 1 0 n 2 − 1 0 n + 1 3 1 0 n 2 − 1 0 n − 1 5 6 0 1 0 ( n + 1 2 ) ( n − 1 3 ) = 1 5 7 3 = 0 = 0 The only positive solution is n = 1 3 , in which case b = 2 1 + 2 1 1 = 6 .