Möbius function and primes: an identity factory with applications
Mathematics of Computation · 23.07.2026
DOI: 10.1090/mcom/4216 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics of Computation, online erschienen am 23.07.2026. Verfasst von Olivier Ramaré und 1 weiteren Autor:innen. Die Arbeit nennt 33 Literaturangaben.
Abstract (Originalsprache)
We investigate the sums ∑ n ≤ X , ( n , q ) = 1 μ ( n ) n s log k ( X n ) \sum _{n\le X, (n,q)=1}\frac {\mu (n)}{n^{s}}\log ^{k}\left (\frac {X}{n}\right ) , where k ∈ { 0 , 1 } k\in \{0,1\} , s ∈ C s\in \mathbb {C} , ℜ s > 0 \Re s>0 . Our goal is to obtain explicit asymptotic estimations for these quantities. To achieve this, we develop a broad framework of identities that we use to derive several applications. Building on similar principles, we also provide an appendix establishing the inequality ∑ n ≤ X Λ ( n ) / n ≤ log X \sum _{n\le X}\Lambda (n)/n\le \log X , valid for any X ≥ 1 X\geq 1 .
Zitieren
APA
Ramaré, O., & Zuniga-Alterman, S. (2026). Möbius function and primes: an identity factory with applications. Mathematics of Computation. https://doi.org/10.1090/mcom/4216
Vancouver
Ramaré O, Zuniga-Alterman S. Möbius function and primes: an identity factory with applications. Mathematics of Computation. 2026. doi:10.1090/mcom/4216
BibTeX
@article{Ramar2026,
author = {Ramaré, Olivier and Zuniga-Alterman, Sebastian},
title = {Möbius function and primes: an identity factory with applications},
journal = {Mathematics of Computation},
year = {2026},
doi = {10.1090/mcom/4216}
}
EUVIMED