Wiki
Wiki

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

Updated

Problem 656

../

claims/: The 1 claim page of Problem 656, one per claimant's result; the problem's standing derives from them.


Statement. Let A⊂NA\subset \mathbb{N} be a set with positive upper density. Must there exist an infinite set B⊆AB\subseteq A and integer tt such that

{b1+b2:b1≠b2∈B}+t⊆A?\{b_1+b_2: b_1\neq b_2\in B\}+t\subseteq A?

Status. Proved. The status-defining source is Theorem 1.2 of Kra, Moreira, Richter and Robertson [KMRR24] (Commun. Amer. Math. Soc. 4 (2024), 480--494, refereed), which proves the statement for every set of positive upper Banach density, of which positive upper density along the intervals is the special case; the paper calls it Erdős's B+B+tB+B+t conjecture. The claim page is Kra, Moreira, Richter and Robertson (accepted on the refereed publication and the site's credit).

Source. erdosproblems.com/656, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #656, https://www.erdosproblems.com/656.

References.

  • [Er75b] Erdős, Paul, Problems and results in combinatorial number theory. Journées Arithmétiques de Bordeaux (Conf., Univ. Bordeaux, Bordeaux, 1974), Astérisque 24--25 (1975), 295--310.
  • [KMRR24] Kra, Bryna and Moreira, Joel and Richter, Florian K. and Robertson, Donald, A proof of Erdős's B+B+tB+B+t conjecture. Commun. Amer. Math. Soc. 4 (2024), 480--494, doi:10.1090/cams/34.

Formalization. No statement file for the problem is in formal-conjectures, and the community database (teorth/erdosproblems) records formalized "no" (both). The development src/latest/ErdosProblems/Erdos656.lean of Boris Alexeev's lean-proofs repository (first added 2026-08-18; formal authors Codex and GPT-5.6 Sol) declares itself a formalization of Kra, Moreira, Richter and Robertson's solution and is linked on their claim page; this corpus has not built it.

Progress

Not yet compiled.

Known Results

Not yet compiled.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.