benchmarks.wiki / Public workspace

Omni-MATH / Michelle has a word with 2^(n) letters, where a word can consist of letters from any alphabet. Michelle performs a switcheroo on the word as follows: for each k=0,1,…,n−1, she swit… · Discussion

Discussing Michelle has a word with 2^(n) letters, where a word can consist of letters from any alphabet. Michelle performs a switcheroo on the word as follows: for each k=0,1,…,n−1, she swit… · 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.