Maths Olympiad Prep

Library / /32 of 47

, 2014

Algebra Difficulty 3.2 AMC 10/12 Prove it Canada

A bag contains 40 balls, each of which is black or gold. Feridun reaches into the bag and randomly removes two balls. Each ball in the bag is equally likely to be removed. If the probability that two gold balls are removed is 512\frac{5}{12}, how many of the 40 balls are gold?
The geometric sequence with nn terms t1,t2,,tn1,tnt_1,t_2,\ldots,t_{n-1},t_n has t1tn=3t_1 t_n=3. Also, the product of all nn terms equals 5904959\,049 (that is, t1t2tn1tn=59049t_1 t_2 \cdots t_{n-1} t_n =59\,049). Determine the value of nn.

(A geometric sequence is a sequence in which each term after the first is obtained from the previous term by multiplying it by a constant. For example, 3, 6, 12 is a geometric sequence with three terms.)

Solution

Solution 1

Suppose that the bag contains gg gold balls.

We assume that Feridun reaches into the bag and removes the two balls one after the other.

There are 40 possible balls that he could remove first and then 39 balls that he could remove second. In total, there are 40(39)40(39) pairs of balls that he could choose in this way.

If he removes 2 gold balls, then there are gg possible balls that he could remove first and then g1g-1 balls that he could remove second. In total, there are g(g1)g(g-1) pairs of gold balls that he could remove.

We are told that the probability of removing 2 gold balls is 512\dfrac{5}{12}.

Since there are 40(39)40(39) total pairs of balls that can be chosen and g(g1)g(g-1) pairs of gold balls that can be chosen in this way, then g(g1)40(39)=512\dfrac{g(g-1)}{40(39)}=\dfrac{5}{12} which is equivalent to g(g1)=512(40)(39)=650g(g-1) = \dfrac{5}{12}(40)(39) = 650.

Therefore, g2g650=0g^2 - g - 650 = 0 or (g26)(g+25)=0(g-26)(g+25) = 0, and so g=26g=26 or g=25g=-25.

Since g>0g>0, then g=26g=26, so there are 26 gold balls in the bag.

Solution 2

Suppose that the bag contains gg gold balls.

We assume that Feridun reaches into the bag and removes the two balls together.

Since there are 40 balls in the bag, there are (402)\displaystyle{40 \choose 2} pairs of balls that he could choose in this way.

Since there are gg gold balls in the bag, then there are (g2)\displaystyle{g \choose 2} pairs of gold balls that he could choose in this way.

We are told that the probability of removing 2 gold balls is 512\dfrac{5}{12}.

Since there are (402)\displaystyle{40 \choose 2} pairs in total that can be chosen and (g2)\displaystyle{g \choose 2} pairs of gold balls that can be chosen in this way, then (g2)(402)=512\dfrac{\displaystyle{g \choose 2}}{\displaystyle{40 \choose 2}}=\dfrac{5}{12} which is equivalent to (g2)=512(402)\displaystyle{g \choose 2} = \dfrac{5}{12}\displaystyle{40 \choose 2}.

Since (n2)=n(n1)2\displaystyle{n \choose 2} = \dfrac{n(n-1)}{2}, then this equation is equivalent to g(g1)2=51240(39)2=325\dfrac{g(g-1)}{2} = \dfrac{5}{12}\dfrac{40(39)}{2} = 325.

Therefore, g(g1)=650g(g-1)=650 or g2g650=0g^2 - g - 650 = 0 or (g26)(g+25)=0(g-26)(g+25) = 0, and so g=26g=26 or g=25g=-25.

Since g>0g>0, then g=26g=26, so there are 26 gold balls in the bag.
Suppose that the first term in the geometric sequence is t1=at_1 = a and the common ratio in the sequence is rr.

Then the sequence, which has nn terms, is a,ar,ar2,ar3,,arn1a, ar, ar^2, ar^3, \ldots, ar^{n-1}.

In general, the kkth term is tk=ark1t_k = ar^{k-1}; in particular, the nnth term is tn=arn1t_n = ar^{n-1}.

Since t1tn=3t_1t_n = 3, then aarn1=3a \cdot ar^{n-1} = 3 or a2rn1=3a^2 r^{n-1} = 3.

Since t1t2tn1tn=59049t_1t_2\cdots t_{n-1}t_n = 59\,049, then (a)(ar) (ar n-2 )(ar n-1 ) = 59 ,049 a n r r 2 r n-2 r n-1 = 59 ,049 (since there are n factors of a on the left side) a n r 1+2+ +(n-2)+(n-1) = 59 ,049 a n r 1 2 (n-1)(n) = 59 ,049\text{(a)(ar) (ar n-2 )(ar n-1 ) = 59 ,049 a n r r 2 r n-2 r n-1 = 59 ,049 (since there are n factors of a on the left side) a n r 1+2+ +(n-2)+(n-1) = 59 ,049 a n r 1 2 (n-1)(n) = 59 ,049} since 1+2++(n2)+(n1)=12(n1)(n)1+2+\cdots+(n-2)+(n-1) = \frac{1}{2}(n-1)(n).

Since a2rn1=3a^2 r^{n-1} = 3, then (a2rn1)n=3n(a^2 r^{n-1})^n = 3^n or a2nr(n1)(n)=3na^{2n} r^{(n-1)(n)} = 3^n.

Since anr12(n1)(n)=59049a^n r^{\frac{1}{2}(n-1)(n)} = 59\,049, then (anr12(n1)(n))2=590492\left(a^n r^{\frac{1}{2}(n-1)(n)}\right)^2 = 59\,049^2 or a2nr(n1)(n)=590492a^{2n} r^{(n-1)(n)} = 59\,049^2.

Since the left sides of these equations are the same, then 3n=5904923^n = 59\,049^2.

Now 59049=3(19683)=32(6561)=33(2187)=34(729)=35(243)=36(81)=3634=31059\,049 = 3(19\,683) = 3^2(6561) = 3^3(2187) = 3^4(729) = 3^5(243) = 3^6(81) = 3^6 3^4 = 3^{10} Since 59049=31059\,049 = 3^{10}, then 590492=32059\,049^2 = 3^{20} and so 3n=3203^n = 3^{20}, which gives n=20n=20.

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

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.