English

Numbers of the form $kf(k)$

Number Theory 2022-10-03 v2

Abstract

For a function f ⁣:NNf\colon \mathbb{N}\to\mathbb{N}, define N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some k} \}. Let τ(n)=dn1\tau(n)=\sum_{d|n}1 be the divisor function, ω(n)=pn1\omega(n)=\sum_{p|n}1 be the prime divisor function, and φ(n)=#{1kn:(k,n)=1}\varphi(n)=\#\{1\leq k\leq n: (k,n)=1 \} be Euler's totient function. We prove that \begin{gather*} \!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\! 1) \quad N^{\times}_{\tau}(x) \asymp \frac{x}{(\log x)^{1/2}}; \\ 2) \quad N^{\times}_{\omega}(x) = (1+o(1))\frac{x}{\log\log x}; \\ \!\!\!\!\!\!\!\!\! 3) \quad N^{\times}_{\varphi}(x) = (c_0+o(1))x^{1/2}, \end{gather*} where c0=1.365...c_0=1.365...\,.

Keywords

Cite

@article{arxiv.2201.09287,
  title  = {Numbers of the form $kf(k)$},
  author = {Mikhail R. Gabdullin and Vitalii V. Iudelevich and Florian Luca},
  journal= {arXiv preprint arXiv:2201.09287},
  year   = {2022}
}

Comments

The error term in Theorem 1.2 is improved in this version of the paper

R2 v1 2026-06-24T08:59:08.808Z