scientific article; zbMATH DE number 3970853

From MaRDI portal
Publication:3737512





For \(n\geq 2\) let \(\beta (n)=\sum_{p | n}p\), \(B(n)=\sum_{p^{\alpha} \| n}\alpha p\), \(B_ 1(n)=\sum_{p^{\alpha} \| n}p^{\alpha}\) and let p(n) denote the largest prime factor of n. The author continues his previous investigation [ibid. 1984, No.2, 11-18 (1984; Zbl 0565.10045)] on the asymptotic formulae for sums involving quotients of \(B_ 1\), \(\beta\), B, p(n) and, in the present paper, proves that \[ (i)\;if\;0<r<1\quad then\quad \sum_{2\leq n\leq x}B^ r_ 1(n)/g^ r(n)=x+O(x/\log x), \] \[ if\quad r>0\quad then\quad \sum_{2\leq n\leq x}g^ r(n)/B^ r_ 1(n)=x+O(x/\log x) \] where \(g(n)=p(n)\) or \(\beta\) (n) or B(n). \[ (ii)\;if\;r>1\quad then\quad \sum_{2\leq n\leq x}B^ r_ 1(n)/B^ r(n) \asymp x^ r/\log^ r x\quad and \] \[ \sum_{2\leq n\leq x}B^ r_ 1(n)/g^ r(n) \asymp x^ r \] where \(g(n)=p(n)\) or \(\beta\) (n).











This page was built for publication:

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