benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Consider a permutation (a₁,a₂,a₃,a₄,a₅) of 1,2,3,4,5. We say the tuple (a₁,a₂,a₃,a₄,a₅) is flawless if for all 1≤i<j<k≤5, the sequence (a_(i),a_(j),a_(k)) is not an arithmetic pr… · Discussion

Discussing Consider a permutation (a₁,a₂,a₃,a₄,a₅) of {1,2,3,4,5}. We say the tuple (a₁,a₂,a₃,a₄,a₅) is flawless if for all 1≤i<j<k≤5, the sequence (a_(i),a_(j),a_(k)) is not an arithmetic pr… · 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.