Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Laczkovich (1984), Theorem 2, statement on printed p. 110 and proof on pp. 114–115 (PDF pp. 2 and 6–7).
Statement
Let be irrational with bounded regular continued-fraction partial quotients. Suppose satisfies
Then is nondecreasing on .
Dependencies. Lemma 2, backward propagation, positive increments, and Lemma 1. The continued-fraction facts imported by Lemma 2 remain explicit. No regularity assumption on is used.
Bears on. Problem 1125, through Theorem 1.
Proof
Fix in . Apply Lemma 2 with closure parameter and endpoint , obtaining a finite seed . It is nonempty because its closure contains whereas the empty seed has empty closure. Let
Backward propagation shows for all with , in particular .
Set . This truncation also satisfies the inequality. If , bound the two later values by the corresponding values; if , both later values are at least . On we therefore have
This single is fixed before choosing any progression length.
Let be an arbitrary integer. The positive-increment decomposition supplies , , with
All the points from to in steps of , followed by the points from to in steps of , lie in the interval where (1) holds. Restricting to either finite progression gives a sequence satisfying the hypotheses of Lemma 1: every valid integer step corresponds to a positive integer multiple of or in .
Two applications of that lemma yield
Since is independent of , letting tend to infinity gives . Finally , so . The pair was arbitrary.