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.1, preprint p. 13, its proof on pp. 13--14; Corollary 4.1 and the remark before it, p. 14. Read on the rendered pages. The edition read is identified on the source card.

Statement

Let m>1m>1 be a fixed integer and (bn)n≥1(b_n)_{n\ge1} a sequence of positive integers such that

lim inf⁡n→∞bnn<1m−1(16)\liminf_{n\to\infty}\frac{b_n}{n}<\frac1{m-1}\qquad(16)

and

mbn−bn−1<n2(17)m^{b_n-b_{n-1}}<\frac n2\qquad(17)

for all large nn. Then ∑n=1∞mbn/n!∉Q\sum_{n=1}^{\infty}m^{b_n}/n!\notin\mathbb{Q}.

Corollary 4.1 (p. 14). Let mm be a positive integer and AA an infinite subset of N\mathbb{N} with lower asymptotic density less than 1/(m−1)1/(m-1), and let bnb_n be the number of elements of AA that are at most nn. Then S=∑n=1∞mbn/n!∉QS=\sum_{n=1}^{\infty}m^{b_n}/n!\notin\mathbb{Q}. The printed proof is that (16) and (17) hold.

Reading notes (observations of this page, not of the paper). The density bound 1/(m−1)1/(m-1) and Theorem 4.1 both need m≥2m\ge2; for m=1m=1 the sum is e−1e-1, irrational for the classical reason. The remark before the corollary says it gives the irrationality of ∑mπ(n)/n!\sum m^{\pi(n)}/n! for m=0,1,2,…m=0,1,2,\ldots (p. 14); for m≥2m\ge2 this is the corollary with AA the primes, of density 00, while for m=0m=0, with 00=10^0=1, the sum is 11, so that case of the remark does not stand.

Proof pointer

Pages 13--14. Assuming the sum is t/qt/q, the integer tN!/q−∑n≤NN! mbn/n!tN!/q-\sum_{n\le N}N!\,m^{b_n}/n! equals a positive tail that (17) keeps below mbNm^{b_N}, while it is divisible by a power of mm whose exponent is governed by [N/m]+[N/m2]+⋯[N/m]+[N/m^2]+\cdots; condition (16) makes −bn+[n/m]+[n/m2]+⋯-b_n+[n/m]+[n/m^2]+\cdots unbounded above, which gives arbitrarily large NN contradicting the inequality (18).

Dependencies

Lemma 2.1 of the same paper.

Bears on

No catalog problem directly.