English

A logarithmic analogue of Alladi's formula

Number Theory 2025-09-18 v2

Abstract

Let μ(n)\mu(n) be the M\"{o}bius function. Let P(n)P^-(n) denote the smallest prime factor of an integer nn. In 1977, Alladi established the following formula related to the prime number theorem for arithmetic progressions n2P(n)(modk)μ(n)n=1φ(k) -\sum_{\substack{n\geq 2\\ P^-(n)\equiv \ell ({\rm mod}k)}}\frac{\mu(n)}{n}=\frac1{\varphi(k)} for positive integers ,k\ell, k\ge with (,k)=1(\ell,k)=1, where φ\varphi is Euler's totient function. In this note, we will show a logarithmic analogue of Alladi's formula in an elementary proof.

Keywords

Cite

@article{arxiv.2504.16002,
  title  = {A logarithmic analogue of Alladi's formula},
  author = {Biao Wang},
  journal= {arXiv preprint arXiv:2504.16002},
  year   = {2025}
}

Comments

15 pages