2006 Alabama ARML TST Problems/Problem 15
Ying lives on Strangeland, a tiny planet with 4 little cities that are each 100 miles apart from each other. One day, Ying begins driving from her home city of Viavesta to the city of Havennew, which takes her about an hour. When she gets to Havennew, she decides she wants to go straight to another city on Strangeland, so she randomly chooses one of the other three cities (possibly Viavesta), and starts driving there. Ying drives like this for most of the day, making 8 total trips between cities on Strangeland, choosing randomly where to drive to next from each stop. She then stops at her final city of destination, digs a hole, and buries her car.
Let be the probability Ying buried her car in Viavesta and let q be the probability she buried it in Havennew. Find the value of .
After the first trip she is surely in Havennew. From this moment on, the other three cities can not be distinguished, so the probability that she is in Viavesta at some point in time is equal to the probability that she is in any of the other two towns.
Let be the probability that she is in Havennew after trips. We already know that , and that after trips the probability of being in each of the other three towns is .
We will now express using . How can Ying get to Havennew after the -th trip? After trips she must be in some other town (this happens with probability ), and in that town she must pick to go to Havennew (this happens with probability ). Therefore .
Using this recurrence, we compute:
The probability that the car is buried in Havennew is . The probability it is buried in Viavesta is .
The result is .
It is worth noting that . In fact, already , and the answer to our question is . The eight steps were enough to virtually eliminate the initial bias that came from starting in a fixed town.
|2006 Alabama ARML TST (Problems)
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15