On certain large additive functions

The author gives a survey of results in a field of research that owes much to Paul Erdős. Let \[ \beta(n)= \sum_{p| n} p,\quad B(n)= \sum_{p^\alpha\parallel n}\alpha p,\quad B_1(n)= \sum_{p^\alpha\parallel n} p^\alpha. \] Various results in the literature involving these large additive functions are described, and, in the last section, sums of the form \[ \sum_{\substack{ n\leq x\\ P(n)\equiv l\pmod k}} (P(n))^{-r} \] and a similar sum with the extra condition \(P^2(n)| n\), where \(P(n)\) denotes the largest prime factor of \(n\), are discussed. The author also poses several problems and gives some new results. He establishes: (i) an asymptotic formula for \(|\{n\leq x: B(n)- \beta(n)= k\}|\) that is uniform for \(k\geq 0\); (ii) an upper bound for \(|\{n\leq x: B(n)-\beta(n)\geq k\}|\) that is uniform for \(k\geq 1\); (iii) an asymptotic formula for \(\sum_{\substack{ n\leq x\\ B(n)-\beta(n)> 0}} (B(n)- \beta(n))^{-r}\) for a given \(r> 0\). There is an extensive list of references. For the entire collection see [Zbl 0999.00015].

Recommendations

Cited in

(14)

This page was built for publication: On certain large additive functions

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