Writeup: IMO Shortlist 2001 A1
Problem Statement:
Let denote the set of all ordered triples of nonnegative integers. Find all functions satisfying
for all nonnegative integers , , .
My Solution:
I've gotten asked a quant interview question almost exactly like this, so I'll rewrite the question in terms of that.
Consider the alternate (and equivalent) question: we have 3-player game involving players , , and , who have , , and coins respectively. Every second, one of , , and is randomly chosen, and they must give a coin to another randomly chosen player. What's the functions in terms of , , and will give the expected amount of time until one of , , or ruin?
We solve this problem with a martingale approach, with stopping condition , , or equal to . Let the amount of money players , , and have at timestep be , , and . Each of these sequences is a random walk. Consider the variable . We know that
which is apparent when substituing all equally likely values of , , and into the expression for . We also know that, at stopping time , must be .
We know that the quantity is conserved, let it be . Then the variable
is a martingale, and . So
So is a candidate function for . Note that this must be the only function that works, since this expected value must be unique. So the only answer is