Source. Jaroslav Hančl and Robert Tijdeman, On the irrationality of
factorial series, Acta Arith. 118 (2005), 383--401; Theorem 3.4,
preprint p. 10, proof p. 11; Corollaries 3.5 and 3.6, p. 11. Page numbers
are those of the preprint named on the
source card.
Statement
Let K≥0, a>0 and b be given integers with an+b=0 for every
n∈N. Let F:R+→R+ be a function such
that, as N→∞,
F(N+j)=r=0∑Kr!F(r)(N)jr+O(NK+1F(N))for j=0,1,…,K,(18)
F(r)(N)=O(NrF(N))for r=0,1,…,K,(19)
N→∞limF(K)(N)=0,N→∞limF(N)NK+1∣F(K)(N)∣=∞,(20)
and
N→∞limsupN∣F(K)(N)∣=∞.(21)
Let f:N→Z be a sequence such that
R∗:=∑N=1∞f(N)/∏n=1N(an+b) is absolutely
convergent and f(N)=(aN+b)F(N)+O(1) as N→∞. Then R∗ is
irrational.
Read depth. Claims checked: the statement was read clause by clause on
the rendered page; the proof was read for structure only. Lemma 2.5, on
which it rests, was not read in full. Nothing here is independently
reviewed.
Proof pointer
p. 11: assuming R∗=p/q, the K-th difference of the tails
RN∗ is 1/q times an integer by Lemma 2.1 and, by Lemma 2.5, equals
(−1)KF(K)(N)(1+o(1))+O(1/N); (20) makes it tend to 0, so it
vanishes for large N, and that contradicts (21).
Consequences on p. 11
- Corollary 3.5:
∑[γNα]/N!∈/Q for α≥0, γ>0.
- Corollary 3.6: for α∈R≥0∖Z and
γ∈R+,
∑N≥1[γNαlogN]/N!∈/Q (Theorem 3.4
with a=1, b=0, K=[α], F(N)=γNα−1logN).
The paper notes (p. 11) that Theorem 3.4 does not reach
∑[NlogN]/N!, which is the reason for
Theorem 3.5.
Relation to Erdős problems
The theorem needs a numerator that is, up to O(1), (aN+b) times a
smooth function with the derivative conditions (18)--(21). The
numerators σk(n) of
Problem 252 and pnk of
the factorial theorem discussed on
Problem 251 are not given in
that form, and the paper does not apply the theorem to them.
Bears on. No catalog problem directly.