ÖMO 2016 Problem 3
Consider arrangements of the numbers through on the squares of an chess board, where each square contains exactly one number and each number appears exactly once. A number in such an arrangement is called super-plus-good, if it is the largest number in its row and at the same time the smallest number in its column. Prove or disprove each of the following statements: (a) Each such arrangement contains at least one super-plus-good number. (b) Each such arrangement contains at most one super-plus-good number.
Proposed by Gerhard J. Woeginger
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.
Similar problems
These problems have the most words in common with this statement.