Not Your Average Bag Of Marbles

There are 100 marbles in a bag. Each marble is one of three different colors. If you were to reach into the bag and select three of the marbles at random, the probability that you would get one of each color is 20%. How many of each color are there?

If the number of marbles of each color are a a , b b , and c c , with a < b < c a<b<c , enter the value of a b + c ab+c as your answer.


The answer is 779.

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.

3 solutions

Matt Enlow
Dec 25, 2020

We can let a a , b b , and c c be the numbers of balls of each of the three colors. So we know that a + b + c = 100 a+b+c=100 . The probability of drawing one marble of each color if you draw three marbles at once is ( a 1 ) ( b 1 ) ( c 1 ) ( a + b + c 3 ) = a b c ( 100 3 ) , \frac{\binom{a}{1}\binom{b}{1}\binom{c}{1}}{\binom{a+b+c}{3}}=\frac{abc}{\binom{100}{3}}, which we know is equal to 20%, or 1 5 \frac{1}{5} . From this we can deduce that a b c = 1 5 ( 100 3 ) = 32340. abc=\frac{1}{5}\binom{100}{3}=32340. These two constraints, along with the fact that a a , b b , and c c are positive integers, are sufficient to solve the problem.

We want to find a way to split 32340 into three factors that add to 100. We start by finding the prime factorization of 32340: 32340 = 2 2 × 3 × 5 × 7 2 × 11 32340=2^2 \times 3 \times 5 \times 7^2 \times 11 Before we go any further, let's establish a handy lemma, the proof of which is left to the reader: The system x + y = S ; x y = P , where S , P R , has a real-valued solution if, and only if, S 2 4 P . \text{The system } x+y=S; xy=P, \text{ where }S,P\in\mathbb{R}\text{, has a real-valued solution if, and only if, }S^2 \geq 4P. The two 7's are either part of the same factor, or of different factors. Suppose they're together. That makes their factor either 49 or 98. But 98 is clearly too large, so it would have to be 49. That would mean that the other two factors sum to 100 49 = 51 100-49=51 , and multiply to 32340 49 = 660 \frac{32340}{49}=660 . But 5 1 2 < 4 × 660 51^2<4 \times 660 , so according to our Lemma, this cannot happen. Therefore the two 7's must be in different factors .

If the 11 were together with one of the 7's, that would make one of the factors 77. Then the other two factors would have to sum to 100 77 = 23 100-77=23 and multiply to 32340 77 = 420 \frac{32340}{77}=420 . But once again, since 2 3 2 < 4 × 420 23^2<4 \times 420 , our Lemma tells us that is not possible. So the 11 is not with either 7 .

Now we can write the three factors, without loss of generality, as a = 7 x a=7x , b = 7 y b=7y , and c = 11 z c=11z for some positive integers x x , y y , and z z . This tells us that 7 x + 7 y + 11 z = 100 7x+7y+11z=100 , or 7 ( x + y ) + 11 z = 100. 7(x+y)+11z=100. Solving this linear Diophantine equation gives x + y = 8 11 n x+y=8-11n and z = 4 + 7 n z=4+7n for any integer n n , but the only value of n n that yields positive values for both x + y x+y and z z is n = 0 n=0 . Therefore x + y = 8 x+y=8 and z = 4 z=4 . Since x x , y y , and z z must be made from factors of 2 2 2^2 , 3 3 , and 5 5 , this gives (without loss of generality) z = 4 z=4 , x = 3 x=3 , and y = 5 y=5 . And therefore, a = 21 , b = 35 , and c = 44. a=21\text{, }b=35\text{, and }c=44.

Since a < b < c a<b<c , we have a b + c = 779. ab+c=779.

That lemma could've come in handy for me for sure! I had to test so many cases that I spent an hour for this not so difficult problem. Nice job @Matt Enlow

Veselin Dimov - 5 months, 2 weeks ago
Pi Han Goh
Dec 27, 2020

I also got the same equations as Matt Enlow above: { a + b + c = 100 a b c = 32340 \begin{cases} a + b + c = 100 \\ abc = 32340 \end{cases} And I also gathered that exactly one of a , b , c a,b,c is divisible by 11, because 32340 is divisible by 11, but not divisible by 1 1 2 11^2 . Let 0 < q < 100 0<q<100 denote the value of one of the solutions of a , b , c a,b,c , then the other 2 roots of a , b , c a,b,c satisfy { A + B = 100 q A B = 32340 / q \begin{cases} A+B = 100-q \\ AB = 32340/q \end{cases} Vieta's formula tells us that there exists distinct integer roots (in X X ) for X 2 ( 100 q ) X + 32340 q = 0 X^2 - (100-q)X + \dfrac{32340}q = 0 and its (quadratic) discriminant is strictly positive, ( 100 q ) 2 4 32340 q > 0 q ( 100 q ) 2 > 129360 21 q 48 (100-q)^2 - 4 \cdot \dfrac{32340}q > 0 \quad \Rightarrow\quad q(100-q)^2 > 129360 \quad \Rightarrow\quad 21 \leqslant q \leqslant 48

Earlier, we have established that exactly one of the values of a , b , c a,b,c is divisible by 11. So we just need to test for the case where q = 22 , 33 , 44 q = 22,33,44 .

Case 1: q = 22 q = 22 , then 2 of the positive integer roots of { a + b + c = 100 a b c = 32340 \begin{cases} a + b + c = 100 \\ abc = 32340 \end{cases} satisfy X 2 ( 100 22 ) X + 32340 22 = 0 X^2 - (100-22)X + \dfrac{32340}{22} = 0 . But this yields no solution.

Case 2: q = 33 q = 33 , then 2 of the positive integer roots of { a + b + c = 100 a b c = 32340 \begin{cases} a + b + c = 100 \\ abc = 32340 \end{cases} satisfy X 2 ( 100 33 ) X + 32340 33 = 0 X^2 - (100-33)X + \dfrac{32340}{33} = 0 . But this yields no solution either.

Case 3: q = 44 q = 44 , then 2 of the positive integer roots of { a + b + c = 100 a b c = 32340 \begin{cases} a + b + c = 100 \\ abc = 32340 \end{cases} satisfy X 2 ( 100 44 ) X + 32340 44 = 0 X^2 - (100-44)X + \dfrac{32340}{44} = 0 . Solving this gives the other two roots of 21 and 35.

Hence, ( a , b , c ) = ( 21 , 35 , 44 ) a b + c = 779 . (a,b,c) = (21,35,44) \Rightarrow ab + c = \boxed{779} .

Saya Suka
Dec 25, 2020

P(getting 1 colour each)
= 3! x (a/100) x (b/99) x (c/98)
= 6abc / (100 x 99 x 98)
= 1/5
abc = 2² x 3 x 5 x 7² x 11
Playing the combinations around a + b + c = 100 from the factors listed in abc = 2² x 3 x 5 x 7² x 11 , we get
a = 21
b = 35
c = 44
for an answer of 21 x 35 + 44 = 779




0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...