Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T23:47:30.920Z Has data issue: false hasContentIssue false

Additive Functions Monotonic on the Set of Primes II

Published online by Cambridge University Press:  20 November 2018

Jean-Marie De Koninck
Affiliation:
Département de mathématiques et statistique, Université Laval, Québec, Québec G1K 7P4
Imre Kátai
Affiliation:
Eötvös Loránd University, Computer Center, 1117 Budapest, Bogdánfy u. 10/B, Hungary, Ontario L8S 4K1
Armel Mercier
Affiliation:
Département de mathématiques, Université du Québec, Chicoutimi, Québec G7H 2B1
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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, ℓ) is the number of primes p ≤ x such that p ≡ ℓ (mod k).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1991