benchmarks.wiki / Public workspace

Omni-MATH / Jacob starts with some complex number x₀ other than 0 or 1. He repeatedly flips a fair coin. If the n^(th ) flip lands heads, he lets x_(n)=1−x_(n−1), and if it lands tails he lets… · Discussion

Discussing Jacob starts with some complex number x₀ other than 0 or 1. He repeatedly flips a fair coin. If the n^(th ) flip lands heads, he lets x_(n)=1−x_(n−1), and if it lands tails he lets… · 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.