Constant components of the Mertens function and its connections with Tschebyschef's theory for counting prime numbers

DOI10.1007/s00574-021-00267-4zbMath1503.11008OpenAlexW3180484434WikidataQ114228884 ScholiaQ114228884MaRDI QIDQ2145172

Paulo A. Martin, André Pierro de Camargo

Publication date: 17 June 2022

Published in: Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00574-021-00267-4

zbMATH Keywords

Möbius functionprime number theoremMertens functionChebyshev theory

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Distribution of primes (11N05)

Related Items (1)

Discretization of prime counting functions, convexity and the Riemann hypothesis

Cites Work

• Unnamed Item
• Unnamed Item
• On sharp elementary prime number estimates
• Inequalities between sums over prime numbers in progressions
• On sums over the Möbius function and discrepancy of fractions
• Explicit estimates for summatory functions linked to the Möbius \(\mu\)-function
• RAMANUJAN SUMS AND THE BURGESS ZETA FUNCTION
• Disproof of the Mertens conjecture.
• Elementary methods in the study of the distribution of prime numbers
• The distribution of the summatory function of the Möbius function
• Chebyshev's Bias
• Biased behavior of weighted Mertens sums
• Further developments in the comparative prime-number theory I
• A new estimate for the sum $M(x)=\sum_{n≤x}μ(n)$

This page was built for publication: Constant components of the Mertens function and its connections with Tschebyschef's theory for counting prime numbers