Geodesic
Additive Functions Monotonic on the Set of Primes II
Canadian journal of mathematics, Tome 43 (1991) no. 4, pp. 705-720

Voir la notice de l'article provenant de la source Cambridge University Press

Let L: [1, ∞) → [1, ∞) be a nondecreasing function such that limx→∞L(x) = +∞. Let f= fL be a strongly additive function determined by f(p) = L(p) on the set of primes. In what followsp, p1, p2, ..., q, q1, q2, ...,P, Q stand for prime numbers, P(n) denotes the largest prime divisor of n. The letters c, c1, c2 , ... denote suitable positive constants, not necessarily the same at each occurrence. As usual, π(x) denotes the number of primes p ≤x, while π(x, k, l) is the number of primes p ≤ x such that p ≡ l (mod k). 
Koninck, Jean-Marie De; Kátai, Imre; Mercier, Armel. Additive Functions Monotonic on the Set of Primes II. Canadian journal of mathematics, Tome 43 (1991) no. 4, pp. 705-720. doi: 10.4153/CJM-1991-040-x
@article{10_4153_CJM_1991_040_x,
     author = {Koninck, Jean-Marie De and K\'atai, Imre and Mercier, Armel},
     title = {Additive {Functions} {Monotonic} on the {Set} of {Primes} {II}},
     journal = {Canadian journal of mathematics},
     pages = {705--720},
     year = {1991},
     volume = {43},
     number = {4},
     doi = {10.4153/CJM-1991-040-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1991-040-x/}
}
TY  - JOUR
AU  - Koninck, Jean-Marie De
AU  - Kátai, Imre
AU  - Mercier, Armel
TI  - Additive Functions Monotonic on the Set of Primes II
JO  - Canadian journal of mathematics
PY  - 1991
SP  - 705
EP  - 720
VL  - 43
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1991-040-x/
DO  - 10.4153/CJM-1991-040-x
ID  - 10_4153_CJM_1991_040_x
ER  - 
%0 Journal Article
%A Koninck, Jean-Marie De
%A Kátai, Imre
%A Mercier, Armel
%T Additive Functions Monotonic on the Set of Primes II
%J Canadian journal of mathematics
%D 1991
%P 705-720
%V 43
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1991-040-x/
%R 10.4153/CJM-1991-040-x
%F 10_4153_CJM_1991_040_x

[1] 1. de Bruijn, N.G., On the number of positive integers ≤ x and free of prime factors > y, Koninkl. Nederl. Akademie Van Wetenschappen, Series A 54(1951), 49–60. +y,+Koninkl.+Nederl.+Akademie+Van+Wetenschappen,+Series+A+54(1951),+49–60.>Google Scholar

[2] 2. De Koninck, J.M., Kátai, I., Mercier, A., Additive functions monotonie on the set of primes, Acta Arith. 57(1991),41–68. Google Scholar

[3] 3. Erdös, P. and Pomerance, C., On the largest prime factors of n and n, + 1, Aequationes Math. 17(1978), 311–321. Google Scholar

[4] 4. Erdös, P., Some remarks on prime factors of integers, Can. J. Math. 11(1959), 161–167. Google Scholar

[5] 5. Halberstam, H. and Richert, H.E., Sieve Methods. L.M.S. Monograph, Academic Press, 1975. Google Scholar

[6] 6. Perelli, A., Pintz, J. and Salerno, S., BombierVs theorem in short intervals II, Invent. Math. 79(1985), 1–9. Google Scholar

[7] 7. Turan, P., On a theorem of Hardy and Ramanujan, J. London Math. Soc. 9(1934), 274–276. Google Scholar

[8] 8. Ward, D.R., Some series involving Euler's function, J. London Math. Soc. 2(1927), 210–214. Google Scholar

Cité par Sources :