In an urn there are a certain number (at least two) of black marbles and a certain number of white marbles. Steven blindfolds himself and chooses two marbles from the urn at random. Suppose the probability that the two marbles are of opposite color is . Let be the smallest possible values for the total number of marbles in the urn. Compute the remainder when is divided by .
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 b and w be the number of black and white marbles in the urn, respectively. Then the probability of two distinct colors being picked is b + w b ⋅ b + w − 1 w + b + w w ⋅ b + w − 1 b = ( b + w ) ( b + w − 1 ) 2 b w . Setting this equal to 2 1 and cross multiplying gives 4 b w ⟹ b + w = ( b + w ) ( b + w − 1 ) = b 2 + 2 b w + w 2 − b − w = b 2 − 2 b w + w 2 = ( b − w ) 2 . It is easy to see that since b − w and b + w are of the same parity, for any value of b − w there will exist an integer pair ( b , w ) that works. The only exception to this is b − w = 1 , as this gives ( b , w ) = ( 1 , 0 ) which is bad. Hence k i = ( i + 1 ) 2 , so i = 1 ∑ 1 0 0 k i ≡ i = 1 ∑ 1 0 1 i 2 − 1 ≡ 6 1 0 1 × 1 0 2 × 2 0 3 − 1 ≡ 5 5 0 ( m o d 1 0 0 0 ) .