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 and positive integers such that once is large and
(printed with "" under the limit, a misprint for ). The sum
is a rational number exactly when some positive integer and some integers satisfy, for every sufficiently large ,
Proof structure (pp. 86--87)
Sufficiency. If (2.4) holds beyond , then equals an integer plus , which telescopes to ; so the series is rational.
Necessity. Let the sum (2.3) be , and take with and whenever . Then (2.5) with and (2.6) . With the integer nearest to and defined by , (2.5) makes an integer smaller than in absolute value, so it vanishes; this gives (2.7)--(2.8) , so is the integer nearest to , and the construction continues.
Remark (p. 87). As (2.2) makes the tails tend to , a rational sum forces ; so either , or from some point on and therefore .
Role
The criterion behind Corollary 2.10, Theorem 3.1 and Theorem 3.7. For it is a criterion for factorial series with ; the later exact tests of Tijdeman–Yuan 2002 and Hančl–Tijdeman 2004 work from increments 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.