Wiki
Wiki

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

Updated


Source. Theorem 2.1, printed pp. 85--86; proof pp. 86--87; Remark on p. 87. Read on the page images.

Statement

Take integers bnb_n and positive integers ana_n such that an≥2a_n\ge2 once nn is large and

lim⁡n→∞∣bn∣an−1an=0(2.2)\lim_{n\to\infty}\frac{|b_n|}{a_{n-1}a_n}=0\qquad(2.2)

(printed with "n=1n=1" under the limit, a misprint for n→∞n\to\infty). The sum

∑n=1∞bna1⋯an(2.3)\sum_{n=1}^{\infty}\frac{b_n}{a_1\cdots a_n}\qquad(2.3)

is a rational number exactly when some positive integer BB and some integers cnc_n satisfy, for every sufficiently large nn,

Bbn=cnan−cn+1,∣cn+1∣<an/2.(2.4)Bb_n=c_na_n-c_{n+1},\qquad|c_{n+1}|<a_n/2 .\qquad(2.4)

Proof structure (pp. 86--87)

Sufficiency. If (2.4) holds beyond NN, then Ba1⋯aN−1∑n≥1bn/(a1⋯an)Ba_1\cdots a_{N-1}\sum_{n\ge1}b_n/(a_1\cdots a_n) equals an integer plus ∑n≥N(cnan−cn+1)/(aN⋯an)\sum_{n\ge N}(c_na_n-c_{n+1})/(a_N\cdots a_n), which telescopes to cNc_N; so the series is rational.

Necessity. Let the sum (2.3) be A/BA/B, and take NN with an≥2a_n\ge2 and ∣bn/(an−1an)∣<1/(4B)|b_n/(a_{n-1}a_n)|<1/(4B) whenever n≥Nn\ge N. Then (2.5) Aa1⋯aN−1=integer+BbN/aN+RNAa_1\cdots a_{N-1}=\text{integer}+Bb_N/a_N+R_N with RN=∑n>NBbn/(aN⋯an)R_N=\sum_{n>N}Bb_n/(a_N\cdots a_n) and (2.6) ∣RN∣<1/2|R_N|<1/2. With cNc_N the integer nearest to BbN/aNBb_N/a_N and cN+1c_{N+1} defined by BbN=cNaN−cN+1Bb_N=c_Na_N-c_{N+1}, (2.5) makes −cN+1/aN+RN-c_{N+1}/a_N+R_N an integer smaller than 11 in absolute value, so it vanishes; this gives (2.7)--(2.8) BbN+1/aN+1=cN+1−RN+1Bb_{N+1}/a_{N+1}=c_{N+1}-R_{N+1}, so cN+1c_{N+1} is the integer nearest to BbN+1/aN+1Bb_{N+1}/a_{N+1}, and the construction continues.

Remark (p. 87). As (2.2) makes the tails RnR_n tend to 00, a rational sum forces cn+1/an→0c_{n+1}/a_n\to0; so either an→∞a_n\to\infty, or from some point on cn=0c_n=0 and therefore bn=0b_n=0.

Role

The criterion behind Corollary 2.10, Theorem 3.1 and Theorem 3.7. For an=na_n=n it is a criterion for factorial series with bn=o(n2)b_n=o(n^2); the later exact tests of Tijdeman–Yuan 2002 and Hančl–Tijdeman 2004 work from increments bn+1−bnb_{n+1}-b_n instead. The paper says the section modifies [2, Lemma 2.29] of the authors' 1971 paper. The Archive of Formal Proofs entry named on the card reports a formalization of this theorem; not inspected here.

Bears on. No catalog problem directly; it is the tool behind the results linked above.