On the existence of magic \(n\)-dimensional rectangles (Q1817565)

An \(m \times n\) magic rectangle is an \(m \times n\) array of the integers \(1, 2, \ldots, mn\) so that the sum of the entries is constant in each row (\(\frac n{mn+1,2}\)) and in each column (\(\frac m{mn+1,2}\)). The necessary conditions (\(m, n >1\), \((m,n) \neq (2,2)\) and \(m\) and \(n\) of the same parity) have long been known to be sufficient. An \(n\)-dimensional magic rectangle is an \(m_1 \times m_2 \times \cdots \times m_n\) array \(A = (a_{i_1, i_2, \ldots, i_n})\) of the integers \(1, 2, \ldots, m_1m_2 \ldots m_n\) so that the row sum \(\sum_{i_j = 1}^{m_j} a_{i_1, i_2, \ldots, i_n}\) is constant independent of the choice of \( i_1, i_2, \ldots, i_{j-1}, i_{j+1}, \ldots , i_n\). Necessary conditions for the existence of \(n\)-dimensional magic rectangles are given and proven to be sufficient in many cases (for example if all \(m_i\) are even and at most one has the value \(2\)).