olymmath

IMAC 2012 Problem 1

    Let a1,a2,...,ana_1,a_2,..., a_n be different integers and let (b1,b2,...,bn),(c1,c2,...,cn)(b_1,b_2,..., b_n),(c_1,c_2,..., c_n) be two of their permutations, different from the identity. Prove that (∣a1−b1∣+∣a2−b2∣+...+∣an−bn∣,∣a1−c1∣+∣a2−c2∣+...+∣an−cn∣)≥2(|a_1-b_1|+|a_2-b_2|+...+|a_n-b_n| , |a_1-c_1|+|a_2-c_2|+...+|a_n-c_n| ) \ge 2 where (x,y)(x,y) denotes the greatest common divisor of the numbers x,yx,y

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator imac/2012/p1 · Tag 11F2FH06YB · Edit this page on GitHub · Keys: j next, k previous