KURSCHAK 1963 Problem 1
students all have different heights. They are arranged in rows of . In each row select the shortest student and let be the height of the tallest such. In each column select the tallest student and let be the height of the shortest such. Which of the following are possible: , , ? If a relation is possible, can it always be realized by a suitable arrangement of the students?
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.