scispace - formally typeset
Journal ArticleDOI

The average prime divisor of an integer in short intervals

Jean-Marie De Koninck, +1 more
- 01 May 1989 - 
- Vol. 52, Iss: 5, pp 440-448
Reads0
Chats0
TLDR
In this paper, it was shown that for each fixed natural number m, there exist computable constants el, e z,..., era, fa,f2..... fro, 0 2).
Abstract
and as usual co(n) is the number of distinct prime factors of n, f2(n) is the total number of prime factors of n, f II n means that p~ (p prime) exactly divides n. It was shown in [1] that, for each fixed natural number m, there exist computable constants el, e z, ..., era, fa,f2 ..... fro, 0 2). These questions were considered in a general setting by De Koninck and Mercier [2], where under suitable conditions asymptotic relations of the form (1.3) Y~ f(P(n)) = (1 + o(1)) Z f(n) (x ~co)

read more

Citations
More filters
Journal ArticleDOI

On the number of polynomial maps into Z_n

TL;DR: In this article, the maximal, minimal, normal and average order of the function n f(n) = II njgcd(n,k!) k =O was studied.
References
More filters
Book

Topics in Multiplicative Number Theory

TL;DR: In this paper, the large sieve and the large moduli of L-functions have been studied in the context of additive prime number theory and mean value theorem of Barban.
Journal ArticleDOI

The Riemann zeta-function

Journal ArticleDOI

On the difference between consecutive primes

TL;DR: In this article, it was shown that by suitable refinements in Section 3 of their paper one can take δ ≤ 1 384, which would be best possible by the present form of their construction.