1997
DOI: 10.1007/bf02465889
|View full text |Cite
|
Sign up to set email alerts
|

The mean values of multiplicative functions. II

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

1998
1998
2017
2017

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…In this paper we continue the investigations of publications [6], [7], [8], [9]. Let G(n) = G(n; g 1 , .…”
Section: Resultsmentioning
confidence: 86%
See 1 more Smart Citation
“…In this paper we continue the investigations of publications [6], [7], [8], [9]. Let G(n) = G(n; g 1 , .…”
Section: Resultsmentioning
confidence: 86%
“…It is easy to apply our Theorem to the functions from a set G (for the definition of G see [8]). For example, let…”
Section: Resultsmentioning
confidence: 99%
“…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.…”
mentioning
confidence: 89%
“…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.…”
Section: Introductionmentioning
confidence: 99%