Abstract: | In the paper, the additive complexity of matrices formed by positive integer powers of greatest common divisors and least common multiples of the indices of the rows and columns is considered. It is proved that the complexity of the n × n matrix formed by the numbers GCDr(i, k) over the basis {x + y} is asymptotically equal to rn log2n as n→∞, and the complexity of the n × n matrix formed by the numbers LCMr(i, k) over the basis {x + y,?x} is asymptotically equal to 2rn log2n as n→∞. |