benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let S=1,2,…,n for some integer n>1. Say a permutation π of S has a …k∈S if …π(k)>π(k+1) for k=1; …π(k−1)<π(k) and π(k)>π(k+1) for 1<k<n; …π(k−1)<π(k) for k=n. …n=5 and π takes va… · Discussion

Discussing Let S={1,2,…,n} for some integer n>1. Say a permutation π of S has a …k∈S if …π(k)>π(k+1) for k=1; …π(k−1)<π(k) and π(k)>π(k+1) for 1<k<n; …π(k−1)<π(k) for k=n. …n=5 and π takes va… · 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.