← All problems

Erdős Problem #264 — Irrationality sequences for powers and factorials

46 years old · traced to

Let N={1,2,…}\mathbb N=\{1,2,\ldots\}, and let (an)n∈N(a_n)_{n\in\mathbb N} be a sequence of positive integers. Call it an irrationality sequence if, for every bounded sequence of integers (bn)n∈N(b_n)_{n\in\mathbb N} satisfying bn≠0b_n\ne 0 and an+bn≠0a_n+b_n\ne 0 for every nn, the series converges to an irrational real number:

∑n=1∞1an+bn.\sum_{n=1}^{\infty}\frac{1}{a_n+b_n}.

Here bounded means that there is a constant C<∞C<\infty with ∣bn∣≤C|b_n|\le C for all nn. The question is whether either of the specific sequences an=2na_n=2^n and an=n!a_n=n! has this property. Kovač and Tao (2024) Erdős Problems #264

Background

Erdős and Graham posed the question in Old and New Problems and Results in Combinatorial Number Theory (1980), as a possible definition of an “irrationality sequence.” The problem page also records a much faster-growing example, an=22na_n=2^{2^n}. Erdős later withdrew an accompanying question about polynomial growth, saying that such a sequence cannot grow more slowly than exponentially. Erdős and Graham (1980) Erdős Problems #264

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.