A bag contains n marbles, some of which are red, the rest of which are white. If you were to draw two marbles (without replacement) from the bag, you'd be just as likely to get different-colored marbles as you would be to get marbles that were the same color. What is the largest possible value of n strictly less than 1000?
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.
Nice! Not only does the number of marbles have to be a square, but there's something else you can say about the number of marbles of each color...
Log in to reply
Right, the difference in the number of marbles of each color equals the sqrt of n (which is always integer as n must be the sqr of an integer). Btw, with n=4, the condition is satisfied with 3 and 1 marbles of each. Btw2, also 1 (=1^2) marble satisfies the condition, as chance to get 2 different or 2 same color is both 0 then...
The problem could have just asked for the largest square less than 1000, then.
Log in to reply
But then you would just get your calculator out and give the answer, and that would just be boring
Let r be the number of red marbles.Then the number of white marbles is n − r .The number of ways we can draw two marbles of the same color is r ( r − 1 ) + ( n − r ) ( n − r − 1 ) while the number of ways we can draw two marbles of different color is r ( n − r ) + ( n − r ) r .These numbers have to be equal for the probability to be the same so we have r ( r − 1 ) + n ( n − 1 ) = 2 r ( n − r ) ⇔ 4 r 2 − 4 n r + n 2 − n = 0 .Solving for r we get r = 2 n − n or r = 2 n + n .Since r is an integer n must be a perfect square.The largest perfect square less than 1000 is 961.Substituting in our last equations to check if the solutions are integral we get r = 4 6 5 and r = 4 9 6 so the number of white marbles is respectively 496 and 465.
For any n square, there is a solution with a = 2 n − n and b = 2 n + n . It's easy to check they're always an integer, and that they are between 0 and n .
Problem Loading...
Note Loading...
Set Loading...
Suppose there are a red marbles and b white marbles. The number of ways to draw two different-colored marbles is a b + b a = 2 a b . The number of ways to draw two same-colored marbles is a ( a − 1 ) + b ( b − 1 ) . Setting these equal and moving some terms around, we get ( a − b ) 2 = a + b . So a + b , the number of marbles, has to be a square. The largest square less than 1 0 0 0 is 9 6 1 . It's not hard to check that a = 4 9 6 , b = 4 6 5 satisfies the conditions of the problem.