Skip to content

Recovering starting stacks in a seven-player doubling game

Question

Seven players take turns in order, each flipping a coin once. On heads, the flipper must pay each of the other six players an amount equal to that player's current stack, doubling it. All seven flips come up heads, and afterwards each player holds exactly $1.28. If x1,…,x7x_1,\dots,x_7 are the players' starting stacks in dollars in flipping order, find 10000(x12+⋯+x72)10000\left(x_1^2+\cdots+x_7^2\right).

Short answer

269374269374. Work backwards from $1.28 each: to undo a payout, halve everyone except the payer and return the halves to the payer. The total $8.96 is conserved, and the starting stacks come out as 4.49,2.25,1.13,0.57,0.29,0.15,0.084.49, 2.25, 1.13, 0.57, 0.29, 0.15, 0.08, whose squares times 1000010000 sum to 269374269374.

Adapted from QuantQuestions.io; question and answer rewritten by SelfMadeQuant.com.

See the hint and the full worked solution in the question bank (free account).

Open the worked solution

Lessons behind this question

Start with a free lesson: Probability Fundamentals is part of a free topic. Create a free account, no card needed, to read it in full with worked solutions.

Read it free