On the density of some sequences of integers
On the density of some sequences of integers
复制标题
关于某些整数序列的密度
DOI:
--
复制
发表时间:
1948
期刊:
影响因子:
--
通讯作者:
P. Erdös
中科院分区:
文献类型:
--
作者:
P. Erdös
Let al<a2< . . * be any sequence of integers such that no one divides any other, and let &<bz< . . * be the sequence composed of those integers which are divisible by at least one a. It was once conjectured that the sequence of b’s necessarily possesses a density. Besicovitch’ showed that this is not the case. Later Davenport and I2 showed that the sequence of b’s always has a logarithmic density, in other words that Em,,, (l/log n) xbisn l/b; exists, and that this logarithmic density is also the lower density of the b’s. It is very easy to see that if Ellai converges, then the sequence of b’s possesses a density. Also it is easy to see that if every pair of a’s is relatively prime, the density of the b’s equals n(ll/a,), that is, is 0 if and only if x.1/a; diverges. In the present paper I investigate what weaker conditions will insure that the b’s have a density. Let f(n) denote the number of a’s not exceeding n. I prove that if f(n) <en/log n, where c is a constant, then the b’s have a density. This result is best possible, since we show that if g(n) is any function which tends to infinity with n, then there exists a sequence a, withf(n) <n.#(n)/log z, for which the density of the b’s does not exist. The former result will be obtained as a consequence of a slightly more precise theorem. Let 4(n; x; yr, y2, * . . , y,J denote generally the number of integers not exceeding 1z which are divisible by x but not divisible by yl, * . . , y,,. Then a necessary and sufficient condition for the b’s to have a density is that