MathDB
entry at intersection of i-th row and the j-th column equals i+ j -1

Source: Switzerland - Swiss TST 1998 p7

February 19, 2020
combinatorics

Problem Statement

Consider an n×nn\times n matrix whose entry at the intersection of the ii-th row and the jj-th column equals i+j1i+ j -1. What is the largest possible value of the product of nn entries of the matrix, no two of which are in the same row or column?