Problem

Source:

Tags:



The first $9$ positive integers are placed into the squares of a $3\times 3$ chessboard. We are taking the smallest number in a column. Let $a$ be the largest of these three smallest number. Similarly, we are taking the largest number in a row. Let $b$ be the smallest of these three largest number. How many ways can we distribute the numbers into the chessboard such that $a=b=4$?