Mean values of arithmetic functions on a sparse set and applications
The paper under review belongs to the long list of articles dealing with sums of the shape \N\[\N\sum_{n \leqslant x} f \left( \lfloor x/n \rfloor \right)\N\] \Nwhere \(\lfloor t \rfloor\) is the integer part of \(t\) and \(f\) is any usual arithmetic function, a topic that seems to have been raised in the article [\textit{O. Bordellès} et al., J. Number Theory 202, 278--297 (2019; Zbl 1454.11009)]. The present work focuses essentially on sums running over primes. More precisely, the authors investigate sums of the shape \N\[\N\sum_{n \leqslant x} \Lambda(n) f \left( \lfloor x/n \rfloor \right) \quad \mathrm{and} \quad \sum_{p \leqslant x} f \left( \lfloor x/p \rfloor \right)\N\] \Nwhere \(\Lambda\) is the von Mangoldt function and \(f\) is any arithmetic function satisfying some mild conditions. The authors establish several asymptotic formulas for the first sum, and precise lower and upper bounds for the second one. For instance, it is shown that \N\[\N\sum_{n \leqslant x} \Lambda(n) \varphi \left( \left \lfloor \frac{x}{n} \right \rfloor \right) = \frac{x \log x}{\zeta(2)} + \begin{cases} O \Bigl( x (\log x)^{2/3} (\log \log x)^{1/3}\Bigr) \\\N\Omega(x) \end{cases} \] and \[\frac{2 \zeta(2)}{15} x \log_2 x + O \left( x \log_3 x \right) \leqslant \sum_{p \leqslant x} \beta \left( \left \lfloor \frac{x}{p} \right \rfloor \right) \leqslant \left( \frac{2 \zeta(2)}{15} + \frac{2}{3} \right) x \log_2 x + O \left( x \log_3 x \right) \N\] \Nwhere \(\varphi(n)\) is the Euler totient function, \(\beta(n)\) is the alternate sum of divisors of \(n\), and \(\log_k x\) is the \(k\)-fold iterated logarithm. As another interesting case, the authors study a class of 'small` arithmetic functions satisfying \(f(n) \ll n^{\theta}\) for some \(0 \leqslant \theta < 1\). In this case, the authors prove the following estimates: for all \(x\) sufficiently large, \N\[\N\sum_{n \leqslant x} \Lambda(n) f \left( \left \lfloor \frac{x}{n} \right \rfloor \right) = x \sum_{n=1}^{\infty} \frac{f(n)}{n(n+1)} + O \left( x e^{-c (\log x)^{1/3} (\log \log x)^{-1/3}}\right) \] and \[\sum_{p \leqslant x} f \left( \left \lfloor \frac{x}{p} \right \rfloor \right) = x \int_{1}^{x^{2/7}} \frac{f( \lfloor u \rfloor )}{u^{2} \log(x/u)} \, \mathrm{d}u + O \left( x e^{-c (\log x)^{1/3} (\log \log x)^{-1/3}}\right).\N\]\NThese formulas generalise or sharpen some recent results of the article [\textit{K. Saito} et al., Res. Number Theory 11, No. 2, Paper No. 50, 28 p. (2025; Zbl 08034693)]. The proofs rely on essential and well-known tools from analytic number theory, such as the indispensable Vaughan identity or Vaaler approximation theorem, and also a Vinogradov type bound for a specific exponential sum.
- An elementary method in prime number theory
- scientific article; zbMATH DE number 194767 (Why is no real title available?)
- Note on a paper by Bordelles, Dai, Heyman, Pan and Shparlinski, 3
- Note on a paper by Bordellès, Dai, Heyman, Pan and Shparlinski
- Note on a paper by Bordellès, Dai, Heyman, Pan and Shparlinski. II.
- On a generalisation of Bordellès-Dai-Heyman-Pan-Shparlinski's conjecture
- On a sum involving small arithmetic functions
- On a sum involving the Euler function
- On a sum involving the Euler function
- On a sum involving the Euler totient function
- On a sum involving the sum-of-divisors function
- On Euler's function
- ON THE PRIMES IN FLOOR FUNCTION SETS
- Primes in floor function sets
- Primes in Short Intervals: Heuristics and Calculations
- Some problems of analytic number theory
- Some remarks on the \([x/n]\)-sequence
- The difference between consecutive primes. II
- The fractional sum of small arithmetic functions
This page was built for publication: Mean values of arithmetic functions on a sparse set and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289341)
