benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Count the number of permutations a₁a₂…a₇ of 1234567 with longest decreasing subsequence of length at most two (i.e. there does not exist i<j<k such that a_(i)>a_(j)>a_(k) ). · Discussion

Discussing Count the number of permutations a₁a₂…a₇ of 1234567 with longest decreasing subsequence of length at most two (i.e. there does not exist i<j<k such that a_(i)>a_(j)>a_(k) ). · 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.