Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Jaroslav Hančl and Robert Tijdeman, On the irrationality of factorial series, Acta Arith. 118 (2005), 383--401; Theorem 3.2, preprint p. 8, proof p. 9; Corollary 3.3, p. 9. Page numbers are those of the preprint named on the source card.
Statement
Let and be integers with for every , and let . Let satisfy as , and suppose
Then, as printed, " for all ", where is the rational number given by (13) of Lemma 3.1 (p. 7): with the least common denominator of ,
an integer, with the Stirling numbers of the second kind of Lemma 2.3.
Corollary 3.3 (p. 9): under the conditions of Theorem 3.2, for all , and therefore .
Filing observation. The proof (p. 9) ends with for , and the conclusion cannot hold for all in general: changing by any integer changes the sum by a rational number and leaves . The statement is read here as for all sufficiently large . This is a reading of the print, not a review verdict.
Read depth. Claims checked: the statement, Lemma 3.1 and Corollary 3.3 were read clause by clause on the rendered pages; the proof was read for structure only. Nothing here is independently reviewed.
Proof pointer
p. 9: Lemma 3.1 splits off the polynomial part, and Oppenheim's criterion (Lemma 2.2) applied to the remaining numerators , which are with a fixed denominator, forces them to vanish from some point on.
Relation to Erdős problems
Corollary 3.4 uses this theorem with Theorem 3.3. The numerators of Problem 252 are not of the form for , so the theorem does not apply to that series.
Bears on. No catalog problem directly.