In how many ways can 9 distinct real numbers be arranged into an \(3\times 3\) array \((a_{ij})\)
such that \(\displaystyle \max_j \min_i a_{ij} = \min_i \max_j a_{ij}\)?

×

Problem Loading...

Note Loading...

Set Loading...