benchmarks.wiki / Public workspace

Omni-MATH / Rosencrantz and Guildenstern each start with 2013 and are flipping a fair coin. When the coin comes up heads Rosencrantz pays Guildenstern 1 and when the coin comes up tails Guilde…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Rosencrantz and Guildenstern each start with $2013\$ 2013 and are flipping a fair coin. When the coin comes up heads Rosencrantz pays Guildenstern $1\$ 1 and when the coin comes up tails Guildenstern pays Rosencrantz $1\$ 1. Let f(n)f(n) be the number of dollars Rosencrantz is ahead of his starting amount after nn flips. Compute the expected value of max{f(0),f(1),f(2),…,f(2013)}\max \{f(0), f(1), f(2), \ldots, f(2013)\}.
Plain-text mathematical notation (without MathML)
Rosencrantz and Guildenstern each start with $2013 and are flipping a fair coin. When the coin comes up heads Rosencrantz pays Guildenstern $1 and when the coin comes up tails Guildenstern pays Rosencrantz $1. Let f(n) be the number of dollars Rosencrantz is ahead of his starting amount after n flips. Compute the expected value of max{f(0),f(1),f(2),…,f(2013)}.
Original LaTeX notation
Rosencrantz and Guildenstern each start with $\$ 2013$ and are flipping a fair coin. When the coin comes up heads Rosencrantz pays Guildenstern $\$ 1$ and when the coin comes up tails Guildenstern pays Rosencrantz $\$ 1$. Let $f(n)$ be the number of dollars Rosencrantz is ahead of his starting amount after $n$ flips. Compute the expected value of $\max \{f(0), f(1), f(2), \ldots, f(2013)\}$.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import