VMO 2002 Problem 3
m < 2001 and n < 2002 are fixed positive integers. A set of distinct real numbers are arranged in an array with 2001 rows and 2002 columns. A number in the array is bad if it is smaller than at least m numbers in the same column and at least n numbers in the same row. What is the smallest possible number of bad numbers in the array?
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.