2017 USAMO Problems/Problem 2

Revision as of 19:41, 20 April 2017 by Mathcounts46 (talk | contribs) (Created page with "==Problem== Let <math>m_1,\dotsc,m_n</math> be a collection of <math>n</math> positive integers, not necessarily distinct. For any sequence of integers <math>A = (a_1,\dotsc,a...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $m_1,\dotsc,m_n$ be a collection of $n$ positive integers, not necessarily distinct. For any sequence of integers $A = (a_1,\dotsc,a_n)$ and any permutation $w_1,\dotsc,w_n$ of $m_1,\dotsc,m_n$, define an $A-inversion$ of $w$ to be a pair of entries $w_i,w_j$ with $i<j$ for which one of the following condition holds: