On the average value of the least common multiple of $k$ positive integers

Titus Hilberdink, László Tóth

Published 2016-04-15Version 1

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$ belongs to a large class of multiplicative arithmetic functions, including, among others, the functions $f(n)=n^r$, $\varphi(n)^r$, $\sigma(n)^r$ ($r>-1$ real), where $\varphi$ is Euler's totient function and $\sigma$ 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([n_1,\ldots,n_k])$ is multiplicative.