MathDB
Least number n for which there exists permutations

Source: Romanian IMO Team Selection Test TST 1987, problem 5

September 25, 2005
inequalitiesrearrangement inequalityalgebra proposedalgebra

Problem Statement

Let AA be the set {1,2,,n}\{1,2,\ldots,n\}, n2n\geq 2. Find the least number nn for which there exist permutations α\alpha, β\beta, γ\gamma, δ\delta of the set AA with the property: i=1nα(i)β(i)=1910i=1nγ(i)δ(i). \sum_{i=1}^n \alpha(i) \beta (i) = \dfrac {19}{10} \sum^n_{i=1} \gamma(i)\delta(i) . Marcel Chirita