Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Theorem 3.2, preprint p. 11, its proof on p. 12; Proposition 3.2, p. 9, with its proof on pp. 9--11. Read on the rendered pages. The edition read is identified on the source card.
Statement
Let be a sequence of positive integers such that form a geometric sequence for infinitely many , and assume that
for sufficiently large. Then .
Proposition 3.2 (p. 9)
The theorem is derived from the proof of this proposition, with , and positive terms. Let and be fixed integers and a sequence of Gaussian integers such that form a geometric sequence for infinitely many , with for sufficiently large (9). Then either , or
for infinitely many such . Here .
Proof pointer
Proposition 3.2 (pp. 9--11) assumes and forms, for large with a geometric run, a Gaussian integer from the tails with -th difference weights. Lemma 2.3 reduces to the displayed main term plus , which bounds by (12), while (13) makes divisible by with ; so . For Theorem 3.2 (, , positive terms) every term of the main sum is positive, and Stirling's formula gives for large (p. 12), so .
Dependencies
Proposition 3.2, Lemma 2.1 and Lemma 2.3 of the same paper. Theorem 4.2 applies this theorem: Theorem 4.2.
Bears on
No catalog problem directly.