benchmarks.wiki / Public workspace

Omni-MATH / Two players play a game, starting with a pile of N tokens. On each player's turn, they must remove 2^(n) tokens from the pile for some nonnegative integer n. If a player cannot mak… · Discussion

Discussing Two players play a game, starting with a pile of N tokens. On each player's turn, they must remove 2^(n) tokens from the pile for some nonnegative integer n. If a player cannot mak… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.