VOOZH about

URL: https://www.erdosproblems.com/265

⇱ Erdős Problem #265


👁 Logo
Forum Inbox Favourites Tags
More
Forum
Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
Let $1\leq a_1<a_2<\cdots$ be an increasing sequence of integers. How fast can $a_n\to \infty$ grow if\[\sum\frac{1}{a_n}\quad\textrm{and}\quad\sum\frac{1}{a_n-1}\]are both rational?
#265: [ErGr80,p.64][Er88c,p.104]
irrationality
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
Cantor observed that $a_n=\binom{n}{2}$ is such a sequence. If we replace $-1$ by a different constant then higher degree polynomials can be used - for example if we consider $\sum_{n\geq 2}\frac{1}{a_n}$ and $\sum_{n\geq 2}\frac{1}{a_n-12}$ then $a_n=n^3+6n^2+5n$ is an example of both series being rational.

Erdős believed that $a_n^{1/n}\to \infty$ is possible, but $a_n^{1/2^n}\to 1$ is necessary.

This has been almost completely solved by Kovač and Tao [KoTa24], who prove that such a sequence can grow doubly exponentially. More precisely, there exists such a sequence such that $a_n^{1/\beta^n}\to \infty$ for some $\beta >1$.

It remains open whether one can achieve\[\limsup a_n^{1/2^n}>1.\]A folklore result states that $\sum \frac{1}{a_n}$ is irrational whenever $\lim a_n^{1/2^n}=\infty$, and hence such a sequence cannot grow faster than doubly exponentially - the remaining question is the precise exponent possible.

View the LaTeX source

This page was last edited 21 January 2026. View history

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)
2 comments on this problem
Likes this problem Vjeko_Kovac, Prasannam
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None
The results on this problem could be formalisable None
I am working on formalising the results on this problem None

Additional thanks to: Vjekoslav Kovac

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #265, https://www.erdosproblems.com/265, accessed 2026-04-11
Previous
Next