GCD and LCM Power Matrices
Shen Ze Chun · The Fibonacci Quarterly · 1996
Let 3 = {xl,x2,...,xn} be a set of distinct positive integers. By (xi9Xj) and [xf,Xj], we denote the greatest common divisor (GCD) and the least common multiple (LCM) of xi and Xj, respectively. The matrix (S) (resp. [S]) having (xi9 Xj) (resp. [xi9 Xj]) as its z, y-entry is called the GCD