Zentralblatt MATH
Publications of (and about) Paul Erdös
Zbl.No: 455.10031
Autor: Erdös, Paul; Ivic, Aleksandar
Title: Estimates for sums involving the largest prime factor of an integer and certain related additive functions. (In English)
Source: Stud. Sci. Math. Hung. 15, 183-199 (1980).
Review: Let P(n) denote the largest prime factor of an integer n \geq 2 and lrt \beta(n) = sump|np, B(n) = sumpa||npa, where as usual pa||n means that pa divides n, but pa+1 does not. The additive functions \beta, B and B1 have been studied recently in several works, including K.Alladi and P.Erdös [Pac. J. Math. 82, 295-315 (1979; Zbl 419.10042)], L.-M.DeKoninck and A.Ivic [Topics in arithmetical functions (Amsterdam 1980; Zbl 442.10032)] and A.Ivic [Arch. Math. 36, 57-61 (1980; Zbl 436.10019)]. The purpose of this work is to estimate sums of the form sum2 \leq n \leq xf(n)/g(n) when f\neq g and f,g in {P(n),\beta(n),B(n),B1(n)}. Some of these sums have been investigated by the aforementioned authors, and for those which were not following asymptotic formulas are obtained: sum2 \leq n \leq xP(n)/B1(n) = x+O(x log log x/ log x),  (1)
sum2 \leq n \leq xB1(n)/P(n) = e\gammax log log x+O(x),  (2)
sum2 \leq n \leq xB1(n)/B(n) = Dx+O(x log-1/3x),  (3)
sum2 \leq n \leq xB1(n)/\beta(n) = e\gammax log log x+O(x),  (4) Here \gamma is Eulers's constant, D > 1 may be explicitly evaluated, and (1) remains true if P(n) is replaced by either \beta(n) or B(n). The proofs depend on six lemmas and utilize estimates for \psi(x,y), the number of positive integers \leq x all of whose prime factors are \leq y. The methods of proof allow one to improve the error term in
sum2 \leq n \leq xB(n)/P(n) = x+O(x log log x/ log x),  (5) to O(x/ log x); (5) was obtained in the aforementioned work of K. Alladi and P. Erdös. The formulas (1)-(4) improve the results of Ch. 6 of the above cited book by J.-M- De Koninck and A. Ivic.
Classif.: * 11N37 Asymptotic results on arithmetic functions
Keywords: sums involving largest prime factor; related additive functions; additive
functions; asymptotic formulas
Citations: Zbl.419.10042; Zbl.442.10032; Zbl.436.10019
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag