VMO 2001 Problem 6
, , ... , is a permutation of 1, 2, ... , 2n such that - | ≠ - | for i ≠ j. Show that = + n iff 1 ≤ ≤ n for i = 1, 2, ... n.
Community text Kalva (prase.cz mirror). 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.
Similar problems
These problems have the most words in common with this statement.