Desert escape

This week’s Riddler classic is about geometry and probability, and desert escape! Here is the (paraphrased) problem:

There are $n$ travelers who are trapped on a thin and narrow oasis. They each independently pick a random location in the oasis from which to start and a random direction in which to travel. What is the probability that none of their paths will intersect, in terms of $n$?

My solution:
[Show Solution]

Leave a Reply

Your email address will not be published. Required fields are marked *