Let's start with one amoeba and call it the first generation. It divides into two off-springs. Both of them are equally likely to either survive or die. If it survives, it again divides into two off-springs; and it goes on...
In the fourth generation, only two amoebas survive. In how many ways, this is possible?
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.
I count 144 ways. I'll use the following diagram, so A is the original amoeba, B and C are its offspring, etc.
We take cases, based on the last common ancestor of the two surviving amoeba.
The last common ancestor of the two surviving amoeba is third generation .
There are 4 ways of choosing the surviving amoeba. For example, the surviving amoeba could be H and I. In this case, the rest of the amoeba in the fourth generation are all dead, A and B have to be alive. E can be dead or alive, and there are 5 ways of choosing the states of C, F, and G, so the number of ways in this case is 4 ⋅ 2 ⋅ 5 = 4 0 .
The last common ancestor of the two surviving amoeba is second generation .
There are 8 ways of choosing the surviving amoeba. For example, the surviving amoeba could be H and J. In this case, B, D, and E have to be alive, and again there are 5 ways of choosing the states of C, F, and G, so the number of ways in this case is 8 ⋅ 5 = 4 0 .
The last common ancestor of the two surviving amoeba is first generation .
There are 16 ways of choosing the surviving amoeba. For example, the surviving amoeba could be H and L. In this case, B, C, D, and F have to be alive. E can be alive or dead, and G can be alive or dead, so the number of ways in this case is 1 6 ⋅ 2 ⋅ 2 = 6 4 .
The total number of ways is then 4 0 + 4 0 + 6 4 = 1 4 4 .