MathDB
IMO ShortList 1999, algebra problem 2

Source: IMO ShortList 1999, algebra problem 2

November 14, 2004
inequalitiescombinatoricsExtremal combinatoricsmatrixIMO Shortlist

Problem Statement

The numbers from 1 to n2n^2 are randomly arranged in the cells of a n×nn \times n square (n2n \geq 2). For any pair of numbers situated on the same row or on the same column the ratio of the greater number to the smaller number is calculated. Let us call the characteristic of the arrangement the smallest of these n2(n1)n^2\left(n-1\right) fractions. What is the highest possible value of the characteristic ?