You have 2N coins of varying denominations (each is a non-negative real number) in a line. Players A and B take turns choosing one coin from either end. Prove A always has a strategy that ensures he end up with at least as much as B.

Communicated by A. Roycoins