Feeling Lucky?

Suppose you have a biased coin which comes up heads with probability 1 3 \frac{1}{3} and tails with probability 2 3 \frac{2}{3} . You then begin to toss the coin repeatedly, with heads worth 1 point and tails worth 2 points, and add up the points as you go along.

Let p ( n ) p(n) be the probability that at some stage you have accumulated precisely n n points. (For example, p ( 1 ) = 1 3 , p ( 2 ) = 2 3 + ( 1 3 ) 2 = 7 9 p(1) = \frac{1}{3}, p(2) = \frac{2}{3} + (\frac{1}{3})^{2} = \frac{7}{9} , etc..)

If lim n p ( n ) = a b \displaystyle\lim_{n\rightarrow \infty} p(n) = \dfrac{a}{b} , where a a and b b are positive coprime integers. Find a + b a + b .


The answer is 8.

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.

1 solution

A quick outline of one solution method....

We have that p ( 0 ) = 1 , p ( 1 ) = 1 3 p(0) = 1, p(1) = \frac{1}{3} , and

p ( n ) = ( 1 3 ) p ( n 1 ) + ( 2 3 ) p ( n 2 ) p(n) = (\frac{1}{3})p(n-1) + (\frac{2}{3})p(n-2) for n 2 n \ge 2 .

Assuming that p ( n ) = r n p(n) = r^{n} for non-zero r r , we have that

r n = ( 1 3 ) r n 1 + ( 2 3 ) r n 2 r = 1 , 2 3 r^{n} = (\frac{1}{3})r^{n-1} + (\frac{2}{3})r^{n-2} \Longrightarrow r = 1, -\frac{2}{3} .

So p ( n ) = A ( 1 ) n + B ( 2 3 ) n p(n) = A*(1)^{n} + B*(-\frac{2}{3})^{n} for some constants A , B A, B . Plugging in the initial conditions p ( 0 ) = 1 , p ( 1 ) = 1 3 p(0) = 1, p(1) = \frac{1}{3} , we find that A = 3 5 A = \frac{3}{5} and B = 2 5 B = \frac{2}{5} .

Thus p ( n ) = 3 5 + ( 2 5 ) ( 2 3 ) n p(n) = \frac{3}{5} + (\frac{2}{5})*(-\frac{2}{3})^{n} , which as n n \rightarrow \infty goes to 3 5 \frac{3}{5} .

Thus a = 3 , b = 5 a = 3, b = 5 and a + b = 8 a + b = \boxed{8} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...