Swans - Solution

It’s simplest to think about the entire flock taking off by working one swan at a time.

After the first swan takes off, we’re at k=1. The probability that a second swan takes off is 111+3=114=34.

After the second swan takes off, we’re at k=2. The probability that a third swan takes off is 112+3=115=45.

After the third swan takes off, we’re at k=3. The probability that a fourth swan takes off is 113+3=116=56.

And so on. At the end, when n1 of the n swans have taken off, we’re at k=n1, so the probability that the last swan takes off is 11n1+3=11n+2=n+1n+2. Notice what happens when n gets big here: we’re subtracting a smaller and smaller number from 1, so n+1n+2 gets really close to 1, meaning the last swans in a big flock taking off are almost certain to take off with the rest.

Now we need to bring it all together. We want the probability that the second swan then takes off and the third swan then takes off and the fourth swan then takes off and

For the entire chain of events to happen, we have to multiply the probabilities of all of these together:

344556n+1n+2

Oh, pretty! All the stuff in the middle cancels out (the 4 with the 4, the 5 with the 5, etc.) – this is called “telescoping,” after the style of old telescopes – and we’re left with just

3n+2

Wow. As we change the flock size n from 3 to 4 to 5 to 6, the probability of the entire flock taking off changes from 35 to 36=12 to 37 to 38. Very quickly it becomes less than half chance that all the swans will leave!

And look at what happens to this answer when n gets really big: the fraction gets really tiny. So even though the last swans in a large flock are almost certain to take off once all their flock-mates do, the probability of all of those previous flock-mates taking off is small since there are so many swans.

Try playing around with the taking-off function 11k+3. What happens to the final answer when you change the function to 11k+1? To 11k? To something completely different?