Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/uniform-distribution-of-the-fractional-part-of-the-average-prime-jinFcdY8O0
References (29)
-
A. Hildebrand, G. Tenenbaum (1988)
On the number of prime factors of an integerDuke Mathematical Journal, 56
-
P. Elliott (1976)
On a problem of hardy and ramanujanMathematika, 23
-
(2002)
Ruth-Aaron numbers revisited’, Paul Erds and his mathematics, Vol.I -
E. Canfield, P. Erdös, C. Pomerance (1983)
On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 17
-
F. Luca (2004)
On f(n) modulo Ω(n) and ω(n) when f is a polynomialJournal of the Australian Mathematical Society, 77
-
L. Kuipers (1974)
Uniform distribution of sequences -
Claudia Spiro-Silverman (1994)
Divisibility of the κ-fold iterated divisor function of n into nActa Arithmetica, 68
-
R. Sitaramachandrarao (1985)
On an error term of Landau-IIRocky Mountain Journal of Mathematics, 15
-
H. Davenport (1967)
Multiplicative Number Theory -
L. Sathe (1954)
On a Problem of Hardy on the Distribution of Integers having a Given Number of Prime Factors IIIJournal of the Indian Mathematical Society, 18
-
M. Drmota, R. Tichy (1997)
Sequences, Discrepancies and Applications -
Lo-keng Hua (1959)
Die Abschätzung von Exponentialsummen und ihre Anwendung in der Zahlentheorie -
G. Hardy, E. Wright (1939)
An Introduction to the Theory of NumbersNature
-
(1976)
Inroduction to analytic number theory -
P. Bateman, P. Erdös, C. Pomerance, E. Straus (1981)
The arithmetic mean of the divisors of an integer -
A. Hildebrand, G. Tenenbaum (1993)
Integers without large prime factorsJournal de Theorie des Nombres de Bordeaux, 5
-
J. Kubilius (1964)
Probabilistic Methods in the Theory of Numbers -
P. Erdös, C. Pomerance (1985)
On the normal number of prime factors of $\phi(n)$Rocky Mountain Journal of Mathematics, 15
-
(2003)
Divisibility of a certain arithmetic function of n into n -
(1990)
On a theorem of Besicovitch: values of arithmetic functions that divide their arguments -
(1959)
Abschätzungen von Exponentialsummen und ihre Anwendung in der Zahlentheorie, Teubner-Verlag -
(1997)
Sequences, discrepancies and applications, Springer-Verlag, Berlin -
C. Spiro (1985)
How often is the number of divisors of n a divisor of nJournal of Number Theory, 21
-
H. Davenport (1980)
Multiplicative number theory / Harold Davenport ; revised by Hugh L. Montgomery -
A. Selberg (1954)
Note on a Paper By L. G. SatheJournal of the Indian Mathematical Society, 18
-
N. Korobov (1992)
Exponential Sums and their Applications -
G. Tenenbaum (1995)
Introduction to Analytic and Probabilistic Number Theory -
L. Carlitz (1965)
Note on a paper of L. BernsteinDuke Mathematical Journal, 32
-
P. Turán (1934)
On a Theorem of Hardy and RamanujanJournal of The London Mathematical Society-second Series
- Publisher
- de Gruyter
- Copyright
- Walter de Gruyter GmbH & Co. KG
- ISSN
- 0933-7741
- eISSN
- 1435-5337
- DOI
- 10.1515/form.2005.17.6.885
- Publisher site
- See Article on Publisher Site
Abstract
We estimate exponential sums with the function ρ ( n ) defined as the average of the prime divisors of an integer n ≥ 2 (we also put ρ (1) = 0). Our bound implies that the fractional parts of the numbers { ρ ( n ) : n ≥ 1 } are uniformly distributed over the unit interval. We also estimate the discrepancy of the distribution, and we determine the precise order of the counting function of the set of those positive integers n such that ρ ( n ) is an integer.
Journal
Forum Mathematicum – de Gruyter
Published: Nov 18, 2005