Very Heavy Coin

Calculus Level 5

You are flipping a coin that has a n 2 1 n 2 \dfrac{n^2-1}{n^2} chance of landing on heads. The value of n n follows these rules:

  • n n and k k initially equal 2.

  • Whenever the coin lands on heads, n n increases by 1.

  • Whenever the coin lands on tails, k k increases by one and then n n is set to equal k k (e.g. the first time you flip tails, k k and n n will both equal 3, then the second time they will equal 4, etc.)

What is the average number of tails you will flip?

Give your answer to 3 decimal places.


The answer is 0.7182818284.

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

Matthew Riedman
May 7, 2016

First, we need to find the probability we flip the first tail. The chance that we flip a head is n 2 1 n 2 \frac{n^2-1}{n^2} , meaning that the probability of getting only heads through p p turns is n = k p n 2 1 n 2 \prod \limits_{n=k}^{p}\frac{n^2-1}{n^2} . After infinite turns, the probability is n = k n 2 1 n 2 \prod \limits_{n=k}^{\infty}\frac{n^2-1}{n^2} . First, we will use the property n = p q a n = exp ( ln ( n = p q a n ) ) = exp ( n = p q ln ( a n ) ) \prod \limits_{n=p}^qa_n=\exp \left(\ln \left(\prod \limits_{n=p}^qa_n\right)\right)=\exp \left(\sum \limits_{n=p}^q\ln \left(a_n\right)\right) to make the product into the form n = 2 ln ( n 2 1 n 2 ) \sum \limits_{n=2}^{\infty}\ln \left(\frac{n^2-1}{n^2}\right) . Using properties of logarithms, this simplifies to exp ( n = 2 ( ln ( n + 1 ) + ln ( n 1 ) 2 ln ( n ) ) ) \exp\left(\sum \limits_{n=2}^{\infty}\left(\ln \left(n+1\right)+\ln \left(n-1\right)-2\ln \left(n\right)\right)\right) . This is a telescoping sum which converges to exp ( ln ( 1 ) ln ( 2 ) + lim n ln ( n ) + ln ( n + 1 ) ) = exp ( ln ( 1 2 ) ) = 1 2 \exp\left(\ln\left(1\right)-\ln\left(2\right)+\lim \limits_{n\to\infty} -\ln\left(n\right)+\ln\left(n+1\right)\right)=\exp\left(\ln\left(\frac{1}{2}\right)\right)=\frac{1}{2} .

This means that there is a 1 1 2 = 1 2 1-\frac{1}{2}=\frac{1}{2} chance we flip at least one tail.

The probability of flipping a second tail once we have flipped the first is n = 3 n 2 1 n 2 \prod \limits_{n=3}^{\infty}\frac{n^2-1}{n^2} . Using the same strategy as the first, we see this is equal to 2 3 \frac{2}{3} , and more generally, n = k n 2 1 n 2 = k 1 k \prod \limits_{n=k}^{\infty}\frac{n^2-1}{n^2}=\frac{k-1}{k} .

This means the probability of getting exactly a a tails is 1 ( a + 1 ) ! a + 1 a + 2 = a + 1 ( a + 2 ) ! \frac{1}{\left(a+1\right)!}\cdot\frac{a+1}{a+2}=\frac{a+1}{\left(a+2\right)!} .

By multiplying the previous expression by a a and summing it from 0 0 to \infty , we get the average number of tails flipped. This is equivalent to:

i = 2 ( ( i 1 ) ( i 2 ) k ! ) \sum \limits_{i=2}^{\infty}\left(\frac{\left(i-1\right)\left(i-2\right)}{k!}\right) by substituting i = a + 2 i=a+2 to make the denominator i ! i!

By expanding and splitting the sum, we get i = 2 i 2 i ! 3 i = 2 1 ( i 1 ) ! + 2 k = 2 1 i ! \sum \limits_{i=2}^{\infty}\frac{i^2}{i!}-3\sum \limits_{i=2}^{\infty}\frac{1}{\left(i-1\right)!}+2\sum \limits_{k=2}^{\infty}\frac{1}{i!}

The second and third sums can be quickly evaluated as e 1 e-1 and e 2 e-2 , respectively, leaving only the first sum. Substituting j = i 1 j=i-1 , the sum becomes j = 1 j + 1 j ! \sum _{j=1}^{\infty}\frac{j+1}{j!} . Splitting this apart and evaluating, we get i = 2 i 2 i ! 3 i = 2 1 ( i 1 ) ! + 2 k = 2 1 i ! = ( e ) + ( e 1 ) 3 ( e 1 ) + 2 ( e 2 ) = e 2 = 0.7182 \sum \limits_{i=2}^{\infty}\frac{i^2}{i!}-3\sum \limits_{i=2}^{\infty}\frac{1}{\left(i-1\right)!}+2\sum \limits_{k=2}^{\infty}\frac{1}{i!}=\left(e\right)+\left(e-1\right)-3\left(e-1\right)+2\left(e-2\right)=e-2=\boxed{0.7182}

Could you explain the formula for getting exactly a tails a little bit? My guess is that to get, for example, exactly one tail, you can get this tail at any position k and then from k+1 onwards you have only heads. From k+1 onwards, I can see the formula you derived applies, but what about the heads that came before k and the probability of the tail at k? Thanks!

Nathan Zhao - 5 months, 4 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...