Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. A. Grebennikov, A. Sagdeev, A. Semchankau and A. Vasilevskii, On the sequence , Rev. Mat. Iberoam. 40 (2024), no. 2, 637-648 (arXiv:2204.01153, first version 3 April 2022, which already contains both results below). Writing , the set of Problem 478, the paper proves (Theorem 1)
and deduces (Corollary 1)
improving García's constant . The paper's source card is Grebennikov, Sagdeev, Semchankau and Vasilevskii 2024.
Covers. The lower bound only. It does not prove , nor the asymptotic the problem asks for, and the paper says that Erdős's conjecture remains open.
Depends on. Nothing in this wiki; the claim is the cited paper's theorem.
Acceptance. Refereed: Revista Matemática Iberoamericana 40 (2024). The site labels the problem OPEN, and its remarks credit this paper with the best known lower bound; that credit is not acceptance.