Complete latin squares of order \(2^ k\) (Q1901050)

It is proved that the \(n\times n\) matrix with \((i, j)\) entry \((i(i- 1)+ j(j- 1))/2\) calculated modulo \(n\) is a complete latin square of order \(n\) if and only if \(n\) is a power of 2. We remind the reader that a latin square is complete if each pair of distinct elements appears as a pair of adjacent entries exactly once in some row and also in some column.