Wiki
Wiki

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.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≥0K\ge0, a>0a>0 and bb be given integers with an+b≠0an+b\ne0 for every n∈Nn\in\mathbb{N}. Let F:R+→R+F:\mathbb{R}_+\to\mathbb{R}_+ be a function such that, as N→∞N\to\infty,

F(N+j)=∑r=0KF(r)(N)r!jr+O(F(N)NK+1)for j=0,1,…,K,(18)F(N+j)=\sum_{r=0}^{K}\frac{F^{(r)}(N)}{r!}j^r+O\Bigl(\frac{F(N)}{N^{K+1}}\Bigr) \quad\text{for }j=0,1,\ldots,K,\qquad(18) F(r)(N)=O(F(N)Nr)for r=0,1,…,K,(19)F^{(r)}(N)=O\Bigl(\frac{F(N)}{N^r}\Bigr)\quad\text{for }r=0,1,\ldots,K,\qquad(19) lim⁡N→∞F(K)(N)=0,lim⁡N→∞NK+1∣F(K)(N)∣F(N)=∞,(20)\lim_{N\to\infty}F^{(K)}(N)=0,\qquad \lim_{N\to\infty}\frac{N^{K+1}|F^{(K)}(N)|}{F(N)}=\infty,\qquad(20)

and

lim sup⁡N→∞N∣F(K)(N)∣=∞.(21)\limsup_{N\to\infty}N|F^{(K)}(N)|=\infty.\qquad(21)

Let f:N→Zf:\mathbb{N}\to\mathbb{Z} be a sequence such that R∗:=∑N=1∞f(N)/∏n=1N(an+b)R^*:=\sum_{N=1}^{\infty}f(N)/\prod_{n=1}^N(an+b) is absolutely convergent and f(N)=(aN+b)F(N)+O(1)f(N)=(aN+b)F(N)+O(1) as N→∞N\to\infty. Then R∗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/qR^*=p/q, the KK-th difference of the tails RN∗R^*_N is 1/q1/q times an integer by Lemma 2.1 and, by Lemma 2.5, equals (−1)KF(K)(N)(1+o(1))+O(1/N)(-1)^KF^{(K)}(N)(1+o(1))+O(1/N); (20) makes it tend to 00, so it vanishes for large NN, and that contradicts (21).

Consequences on p. 11

  • Corollary 3.5: ∑[γNα]/N!∉Q\sum[\gamma N^\alpha]/N!\notin\mathbb{Q} for α≥0\alpha\ge0, γ>0\gamma>0.
  • Corollary 3.6: for α∈R≥0∖Z\alpha\in\mathbb{R}_{\ge0}\setminus\mathbb{Z} and γ∈R+\gamma\in\mathbb{R}_+, ∑N≥1[γNαlog⁡N]/N!∉Q\sum_{N\ge1}[\gamma N^\alpha\log N]/N!\notin\mathbb{Q} (Theorem 3.4 with a=1a=1, b=0b=0, K=[α]K=[\alpha], F(N)=γNα−1log⁡NF(N)=\gamma N^{\alpha-1}\log N).

The paper notes (p. 11) that Theorem 3.4 does not reach ∑[Nlog⁡N]/N!\sum[N\log N]/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)O(1), (aN+b)(aN+b) times a smooth function with the derivative conditions (18)--(21). The numerators σk(n)\sigma_k(n) of Problem 252 and pnkp_n^k 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.