The mean value theorem for the product of multiplicative functions with arguments from arithmetic progression when the variable of these progressions runs over primes is proved. This theorem is used for the investigation of the limit behaviour of a sum of additive functions.
The mean value theorem for the product of multiplicative functions with arguments from arithmetic progression when the variable of these progressions runs over primes is proved. This theorem is used for the investigation of the limit behaviour of a sum of additive functions.
“…Finally the estimate (16) and the relation (15) show that the distributions (1) converge weakly to the Poisson law with the parameter λ. Theorem 3 is proved.…”
Section: Proof Of Theoremmentioning
confidence: 96%
“…From his result the central limit theorem for the difference of consecutive values of some additive function follows. More general results were later established by Kubilius [8], Kátai [7], Hildebrand [6], Elliott [1][2][3][4], Timofeev and Usmanov [18], Stepanauskas [14][15][16][17], etc. In these works, the class of additive functions was expanded.…”
We consider the limit distribution of values of a sum of additive arithmetic functions with shifted argument. The case of the Poisson limit distribution is studied. The functions considered take at most two values on the set of primes, 0 and 1, and satisfy some additional conditions. Some examples are given.
“…A lot of work has been done to find the asymptotic behavior of M x,h (F, G) under various conditions, (see for example [17], [12], [18], [19], [5], [20]). In many of those cases, the functions are required to be close to 1 on the set of primes.…”
ABSTRACT. In this paper, we consider the mean value of the product of two real valued multiplicative functions with shifted arguments. The functions F and G under consideration are close to two nicely behaved functions A and B, such that the average value of A(n − h)B(n) over any arithmetic progression is only dependent on the common difference of the progression. We use this method on the problem of finding mean value of K(N), where K(N)/ log N is the expected number of primes such that a random elliptic curve over rationals has N points when reduced over those primes.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.