Abstract/Summary

We deduce an asymptotic formula with error term for the sum ∑n1,…,nk≤xf([n1,…,nk]), where [n1,…,nk] stands for the least common multiple of the positive integers n1,…,nk (k≥2) and f belongs to a large class of multiplicative arithmetic functions, including, among others, the functions f(n)=nr, φ(n)r, σ(n)r (r>−1 real), where φ is Euler's totient function and σ is the sum-of-divisors function. The proof is by elementary arguments, using the extension of the convolution method for arithmetic functions of several variables, starting with the observation that given a multiplicative function f, the function of k variables f([n1,…,nk]) is multiplicative.