benchmarks.wiki / Public workspace

Omni-MATH / Find the smallest positive integer n such that, if there are initially n+1 townspeople and n goons, then the probability the townspeople win is less than 1%. · Discussion

Discussing Find the smallest positive integer n such that, if there are initially n+1 townspeople and n goons, then the probability the townspeople win is less than 1%. · 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.