On the average value of the least common multiple of kk positive integers

preprint2016arXivOpen access

Abstract

We deduce an asymptotic formula with error term for the sum ∑n1,…,nk≤xf([n1,…,nk])\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k]), where [n1,…,nk][n_1,\ldots, n_k] stands for the least common multiple of the positive integers n1,…,nkn_1,\ldots, n_k (k≥2k\ge 2) and ff belongs to a large class of multiplicative arithmetic functions, including, among others, the functions f(n)=nrf(n)=n^r, φ(n)rφ(n)^r, σ(n)rσ(n)^r (r>−1r>-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 ff, the function of kk variables f([n1,…,nk])f([n_1,\ldots,n_k]) is multiplicative.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.