On Euler's example of a completely multiplicative function with sum 0

DOI10.1016/J.CRMA.2016.03.009MaRDI QIDQ5890645zbMATH OpenOpenAlexFDO

Authors Éric Saïas, Jean-Pierre Kahane

Publication date 12 May 2016

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1603.04832

zbMATH Keywords

Beurling generalized integerscompletely multiplicative function with sum \(0\)

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Asymptotic results on arithmetic functions (11N37) Rate of growth of arithmetic functions (11N56) Generalized primes and integers (11N80)

Abstract: Euler wrote a formula expressing that l(n)/n is a completely multiplicative function with sum 0 (a CMO function) , where l(n) is the completely multiplicative function equal to -1 on the prime numbers (the Liouville function). We extend this formula to Beurling generalized numbers, using a result of Diamond. As an application we show how to construct a CMO function carried by a set of integers whose counting function is of the form D x^a (1+o(1) ) for any a between 0 and 1.

Review text

A CM0 function is a completely multiplicative function \(f\) defined on positive integers such that \(\sum_{n=1}^\infty f(n)=0\). Euler gave an example of a CM0 defined by \(f(p)=-1/p\), \(p\) a prime number. The authors indicate a proof (with the details explained in [``Fonctions complètement multiplicatives de somme nulle, Preprint, \url{arXiv:1507.04858}]) that if \((\mathcal{P},\mathcal{N})\) is a set of Beurling's generalized integers with \(\mathcal{P}\) the set of generators (primes) satisfying \textit{H. G. Diamond}'s [J. Reine Angew. Math. 295, 22--39 (1977; Zbl 0355.10038)] ``regularity condition \(\int_2^\infty |\pi_{\mathcal{P}}(t)-(t/\log t)|t^{-2}\,dt<\infty\) for the prime function \(\pi_{\mathcal{P}}(t)=\sum_{p\in{\mathcal P},p\leq t}1\) then (Theorem 3) \(\sum_{n\in{\mathcal N}}\lambda_{\mathcal P}(n)/n=0\), where \(\lambda_{\mathcal P}\) is completely multiplicative and \(\lambda_{\mathcal P}=-1\) for \(p\in{\mathcal P}\). It follows from this (Theorem 1) that, for every \(\alpha\in(0,1)\), it is possible to construct a CM0 function \(f\) on the set of positive integers such that \(\sum_{f(n)\neq0, n\leq x}1\sim Dx^\alpha\) (\(x\to\infty\)) for some \(D>0\).

Recommendations

• On Euler's example of a completely multiplicative function with sum 0
• Completely multiplicative functions with sum zero over generalised prime systems
• On the distribution of Beurling integers
• scientific article; zbMATH DE number 970251
• On zero-density estimates and the PNT in short intervals for Beurling generalized numbers
• Chebyshev Type Estimates for Beurling Generalized Prime Numbers. II
• On some generalized integers
• Prime number theorem equivalences and non-equivalences
• Diamond's version of the Dirichlet hyperbola method
• scientific article; zbMATH DE number 1742568

Cites work

• When do Beurling generalized integers have a density?

Cited in

(5)

• Completely multiplicative functions of sum zero
• Completely multiplicative functions with sum zero over generalised prime systems
• On Diamond's \(L^1\) criterion for asymptotic density of Beurling generalized integers
• Conditions for Beurling numbers to have a density
• On Euler's example of a completely multiplicative function with sum 0

This page was built for publication: On Euler's example of a completely multiplicative function with sum 0

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890645)