benchmarks.wiki / Public workspace

Omni-MATH / Define the annoyingness of a permutation of the first n integers to be the minimum number of copies of the permutation that are needed to be placed next to each other so that the s… · Discussion

Discussing Define the annoyingness of a permutation of the first n integers to be the minimum number of copies of the permutation that are needed to be placed next to each other so that the s… · 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.