Wiki
Wiki

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

Updated


Source. Theorem 4.3 and its proof, Corollary 4.2 and its proof, preprint p. 15. Read on the rendered page. The edition read is identified on the source card.

Statement

Let mm be a Gaussian integer and (bn)n≥1(b_n)_{n\ge1} a sequence of positive integers for which bN,bN+1,…,b4Nb_N,b_{N+1},\ldots,b_{4N} form an arithmetic progression for infinitely many positive integers NN such that 2N−12N-1 is prime. Assume that bn=o(nlog⁡n)b_n=o(n\log n). Then

∑n=1∞mbnn!∉Q[i].\sum_{n=1}^{\infty}\frac{m^{b_n}}{n!}\notin\mathbb{Q}[i].

The case m=0m=0 (an observation of this page). The printed statement admits m=0m=0, for which the sum is 00; the proof writes mbN+1−bNm^{b_{N+1}-b_N} as a quotient c/dc/d with cc a Gaussian integer and dd a positive integer coprime to cc, and the theorem is to be read for m≠0m\ne0, as the abstract (p. 1) has it.

Corollary 4.2 (p. 15). π\pi is irrational. The proof supposes π=t/q\pi=t/q with t,q∈Nt,q\in\mathbb{N} and applies the theorem with m=itm=it and bn=nb_n=n to (−1)q=eit=∑n≥0(it)n/n!(-1)^q=e^{it}=\sum_{n\ge0}(it)^n/n!.

Proof pointer

By the proof of Proposition 3.2 (see Theorem 3.2) it suffices that DN≠0D_N\ne0. Identity (13) with a=1a=1, b=0b=0 shows that DND_N is a Gaussian integer divisible by N!N!; since 2N−12N-1 is prime, every term in its expansion is divisible by 2N−12N-1 except the one with k=Nk=N, n=2N−1n=2N-1, so DND_N is not divisible by 2N−12N-1 and is nonzero.

Dependencies

Proposition 3.2 and Lemma 2.3 of the same paper.

Bears on

No catalog problem directly.