Divisibility of determinants of least common multiple matrices on GCD-closed sets (Q1879067)

If \(S =\{x_1,\dots ,x_n\}\) is a set with \(n\) distinct positive integers, then by \((S)_n\) (resp. \([S]_n\)) the author denotes the matrix of order \(n\) having the greatest (resp. least) common divisor (resp. multiple) of \(x_i\) and \(x_j\) in position \((i,j)\) \((1\leq i, j \leq n)\). The set \(S\) is said to be GCD-closed if \((x_i, x_j) \in S\) for all \(1 \leq i, j \leq n\). In this paper the author shows that if \(n \leq 3\), then for any GCD-closed set \(S\), the determinant of \((S)_n\) divides the determinant of \([S]_n\), but for any integer \(n \geq 4\), there exists a GCD-closed set \(S\) such that the determinant of \((S)_n\) does not divide the determinant of \([S]_n\). Also, the author shows that the determinant of \((S)_n\) divides the determinant of \([S]_n\) if each element in \(S\) is less than \(12\).