Maths Olympiad Prep

Library / /11 of 33

, 2011

Combinatorics Difficulty 7.7 National Olympiad, round 2 Prove it Baltic Way

In an urn there are 100100 balls each coloured either blue, red or green. If you draw (without repetitions) two balls randomly from the urn, the probability of getting two balls of different colour is 58%58\%, and the probability of getting a blue and a green ball is 8%8\%. How many red balls are there among the 100100 balls?

Solutions — 2

Solution 1

Let bb, rr and gg be the number of blue, red and green balls, respectively. We know that b+r+g=100b + r + g = 100.

If you draw two balls randomly from the urn, the probability of getting two balls of different colour is 58%58\%, and the probability of getting a blue and a green ball is 8%8\% and hence the probability of getting a red ball and a ball of a different colour is 50%50\%.

Hence r(100r)+(100r)r10099=12\frac{r(100 - r) + (100 - r)r}{100 \cdot 99} = \frac{1}{2}.

From this we get the quadratic equation r2+100r2475=0-r^2 + 100r - 2475 = 0, and r=45r = 45 or r=55r = 55.

Suppose r=45r = 45. Then b+g=55b + g = 55, and since the probability of having blue and a green ball is 8%8\%, then g(55g)+(55g)g10099=8100\frac{g(55 - g) + (55 - g)g}{100 \cdot 99} = \frac{8}{100}.

This leads to the quadratic equation g2+55g396=0-g^2 + 55g - 396 = 0 with no integer roots, and hence a contradiction.

The only possibility therefore r=55r = 55. (In this case we get b=33b = 33 and g=12g = 12 or the other way around.)

Solution 2

Let bb, rr and gg be the number of blue, red and green balls, respectively. From the probabilities stated we get 2bg10099=8100\frac{2bg}{100 \cdot 99} = \frac{8}{100} and 2(rg+rb+gb)99100=58100\frac{2(rg + rb + gb)}{99 \cdot 100} = \frac{58}{100}, and hence
2bg=899and2(rg+rb+gb)=5899. 2bg = 8 \cdot 99 \quad \text{and} \quad 2(rg + rb + gb) = 58 \cdot 99.
From the first equation we see 1111 divides exactly one of bb and gg, and hence from the second 1111 must also divide rr. Assume w.l.o.g. that 1111 divides gg and let g=11gg = 11g'. Since r+b+g=100r + b + g = 100 we have b1(mod11)b \equiv 1 \pmod{11}. The first equation is now bg=36bg' = 36, and hence b=1b = 1 or b=12b = 12. If b=12b = 12 we get g=1136>100g = 11 \cdot 36 > 100 which is impossible. The only solution is therefore b=12b = 12, g=33g = 33 (the other way around) and r=55r = 55.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.