Difference between revisions of "2017 USAMO Problems/Problem 2"

Revision as of 13:21, 27 November 2017

deez nuts

Revision as of 19:41, 20 April 2017 (view source) 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...")		Revision as of 13:21, 27 November 2017 (view source) Definitely not allen (talk \| contribs) m (→‎Problem) Newer edit →
Line 1:		Line 1:
−	~~==Problem==~~	+	deez nuts
−	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_n)</math> and any permutation <math>w_1,\dotsc,w_n</math> of <math>m_1,\dotsc,m_n</math>, define an <math>A-inversion</math> of <math>w</math> to be a pair of entries <math>w_i,w_j</math> with <math>i<j</math> for which one of the following condition holds: