Counting numbers in multiplicative sets: Landau versus Ramanujan

MaRDI QIDQ5166957zbMATH OpenFDO

Authors Pieter Moree

Publication date 9 July 2014

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

zbMATH Keywords

arithmetic progressionmultiplicative functionEuler-Kronecker constantmultiplicative setLandau approximationRamanujan approximation

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Evaluation of number-theoretic constants (11Y60)

Abstract: A set S of integers is said to be multiplicative if for every pair m and n of coprime integers we have that mn is in S iff both m and n are in S. Both Landau and Ramanujan gave approximations to S(x), the number of n<=x that are in S, for specific choices of S. The asymptotical precision of their respective approaches are being compared and related to Euler-Kronecker constants, a generalization of Euler's constant gamma=0.57721566.... This paper claims little originality, its aim is to give a survey on the literature related to this theme with an emphasis on the contributions of the author (and his coauthors).

Recommendations

• Counting numbers in multiplicative sets: Landau versus Ramanujan
• On some arithmetical multiplicative functions
• On sums of multiplicative functions over numbers all of whose prime divisors belong to given arithmetic progressions
• Landau and Ramanujan approximations for divisor sums and coefficients of cusp forms
• scientific article; zbMATH DE number 4004286

Cited in

(3)

• On a class of arithmetic functions related to the divisors of an integer
• Forbidden integer ratios of consecutive power sums
• Counting numbers in multiplicative sets: Landau versus Ramanujan

This page was built for publication: Counting numbers in multiplicative sets: Landau versus Ramanujan

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