Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 4.1, preprint p. 13, its proof on pp. 13--14; Corollary 4.1 and the remark before it, p. 14. Read on the rendered pages. The edition read is identified on the source card.
Statement
Let be a fixed integer and a sequence of positive integers such that
and
for all large . Then .
Corollary 4.1 (p. 14). Let be a positive integer and an infinite subset of with lower asymptotic density less than , and let be the number of elements of that are at most . Then . The printed proof is that (16) and (17) hold.
Reading notes (observations of this page, not of the paper). The density bound and Theorem 4.1 both need ; for the sum is , irrational for the classical reason. The remark before the corollary says it gives the irrationality of for (p. 14); for this is the corollary with the primes, of density , while for , with , the sum is , so that case of the remark does not stand.
Proof pointer
Pages 13--14. Assuming the sum is , the integer equals a positive tail that (17) keeps below , while it is divisible by a power of whose exponent is governed by ; condition (16) makes unbounded above, which gives arbitrarily large contradicting the inequality (18).
Dependencies
Lemma 2.1 of the same paper.
Bears on
No catalog problem directly.