Question 32
From the set $\{1,2,3, \ldots, n\}$ we choose 9 pairwise distinct numbers and write them in the cells of a $3 \times 3$ table so that the products of the numbers in each row, each column and both diagonals are equal. Determine the smallest value of $n$ for which such a table exists.