No label defined (Q3981024)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 23208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 23208 |
Statements
26 June 1992
0 references
asymptotic formulas
0 references
distribution of values
0 references
Euler phi-function
0 references
sum of divisor function
0 references
multiplicative functions
0 references
0.8449786901473999
0 references
The author proves that, for \(0<c<2^{-1/2}\), \[ \sum_{f(n)\leq x}1=A(f)x+O_{c,B}(x\exp(-c(\log x\log\log x)^{1/2})). \leqno (1) \] Here \(f(n)\) belongs to the class \(S\) of multiplicative functions such that \(f(p^ k)=p^ k+a_{1,k}p^{k-1}+\cdots+a_{k-1,k}p+a_{k,k} (-1\leq a_{i,k}\leq B)\), and for some \(H>0\) \[ f(n)\gg n(\log\log n)^{- H}, \] while \(A(f)=\prod_ p(1-p^{-1})(1+\sum^ \infty_{k=1}(p^ k+a_{1,k}p^{k-1}+\cdots+a_{k-1,k} p+a_{k,k})^{-1})\). The error term in (1) is sharper than \(O_ \varepsilon(x\exp(-(\log x)^{3/8-\varepsilon}))\), obtained by the reviewer [Publ. Inst. Math., Beograd, Nouv. Sér. 22(36), 87-94 (1977; Zbl 0376.10033)], who used in the proof the theory of Beurling's generalized primes. The author's proof of (1) is completely elementary. A nice aspect of his result is that in the case of the familiar functions \(\varphi (n)\), \(\sigma(n)\in S\), the error term in (1) is the same as the strongest known one, obtained earlier by analytic methods.
0 references