Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Theorem 4.3, preprint p. 9, with its proof (p. 9), the sentence before it (p. 8) and the Remark after it (p. 9). Read on the rendered pages. The paper is cited by its record on the source card.

Statement

Let (an)n≥1(a_n)_{n\ge1} and (bn)n≥1(b_n)_{n\ge1} be sequences of positive integers with

anbn+1−an+1bn≤bn+1−bnfor all large n.a_nb_{n+1}-a_{n+1}b_n\le b_{n+1}-b_n\qquad\text{for all large }n.

Then ∑n≥1bn/(a1⋯an)\sum_{n\ge1}b_n/(a_1\cdots a_n) is rational if and only if (an−1)/bn(a_n-1)/b_n is constant for n≥n0n\ge n_0.

The hypothesis can be rewritten as bn+1(an−1)≤bn(an+1−1)b_{n+1}(a_n-1)\le b_n(a_{n+1}-1); when every an>1a_n>1 this is bn+1/(an+1−1)≤bn/(an−1)b_{n+1}/(a_{n+1}-1)\le b_n/(a_n-1), the form in which the abstract (p. 1) states criterion (ii). The sentence before the theorem (p. 8) presents it as a variant of Theorem 4.2 in which ana_n need not be monotonic, with a proof of a different structure. As throughout the paper, convergence of the series is assumed when its rationality is discussed (p. 2).

Proof pointer (p. 9)

One direction follows from Lemma 2.1. For the other, with S=r/qS=r/q: if the remainders RnR_n are eventually nonincreasing, the end of the proof of Theorem 4.2 applies; an index with Rm+1>RmR_{m+1}>R_m is ruled out by an identity (the paper's (9)) derived from Rn+1=anRn−bnR_{n+1}=a_nR_n-b_n, together with the hypothesis, which make the increments grow and force bn/an→0b_n/a_n\to0, and then qRn∈ZqR_n\in\mathbb{Z} forces Rn=0R_n=0, which is impossible.

Consequences in the paper

The Remark after the proof (p. 9) derives Badea's criterion, case (i) of Corollary 4.1, from this theorem by rewriting the Ahmes-type series as a Cantor series, and Corollary 4.2 (pp. 9--10) is obtained in a similar way.

Bears on. No catalog problem directly; its consequences Corollary 4.1 and Corollary 4.2 carry the relation to problem 243.