benchmarks.wiki / Public workspace

Omni-MATH / For any positive integer n,S_(n) be the set of all permutations of …π∈S_(n), let f(π) be the number of ordered pairs (j,k) for which π(j)>π(k) and 1≤j<k≤n. Further define g(π) to b… · Discussion

Discussing For any positive integer n,S_(n) be the set of all permutations of …π∈S_(n), let f(π) be the number of ordered pairs (j,k) for which π(j)>π(k) and 1≤j<k≤n. Further define g(π) to b… · 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.