On completely dense sequences. (English) Zbl 1024.11052

The sequence \((x_n)\) of real numbers is completely dense in an interval \(I\) if for every \(s =1, 2, \dots \) the \(s\)-dimensional sequence \(((x_{n+1}, x_{n+2},\dots , x_{n+s}))\) is dense in \(I^s\). The authors give the following sufficient condition for the complete density of a multiplicative arithmetic function: Let \(p_n\) denote the \(n\)-th prime number, and let \(f (n)\) be a positive multiplicative function satisfying the following conditions: (i) \(\lim _{n\rightarrow \infty } f(p_n)^n = 1\), (ii) \( \prod _{p_n, f (p_n) > 1} f (p_n) = + \infty \), \(\prod _{p_n , f(p_n) < 1} f (p_n) = 0\). Then the sequence \((f (n))\) is completely dense in the set of positive real numbers. In the second part of the paper it is shown that in the space of all real sequences endowed with the Fréchet metric, the family of all completely dense sequences is residual.


11K36 Well-distributed sequences and other variations
Full Text: EuDML


[1] J. Bukor J. Toth: On some properties of values of a class of arithmetical functions. Publ. Math. Debrecen 46 (1995), 187-193. · Zbl 0858.11007
[2] N. M. Korobov: On functions with uniformly distributed fractional parts. (Russian), Dokl. Akad. Nauk SSSR 62 (1948), 21-24.
[3] L. Kuipers H. Niederreiter: Uniform distribution of sequences. John Wiley, New York, 1974. · Zbl 0281.10001
[4] A. Schinzel: On functions \(\varphi(n)\) and \(\sigma(n)\). Bull. Acad. Pol. Sci., CI. III, 3 (1955), 415-419. · Zbl 0065.27103
[5] L. P. Starčenko: The construction of a completely uniformly distributed sequence. (Russian), Dokl. Akad. Nauk SSSR 129 (1959), 512-521. · Zbl 0087.04401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.