Corroborate

Claim in Erdős problems named in new papers, 2026-10

A published paper or arXiv preprint answers the main question of Erdős Problem #32 (theorem erdos_32 in formal-conjectures) in full (proof, disproof, or the exact value asked for) with no hypotheses beyond the problem's own.

Problem as stated at github.com/google-deepmind/formal-conjectures/blob/34ee0e3c5fd52d202d62a71094a37970cb5fb870/FormalConjectures/ErdosProblems/32.lean. The claim text is written by Corroborate; that site has not reviewed or endorsed it.

The problem, as stated in formal-conjectures (Apache 2.0):

Does there exist a set A \subseteq \mathbb{N} such that |A \cap \{1, \ldots, N\}| = o((\log N)^2) and every sufficiently large integer can be written as p + a for some prime p and a \in A?

Verdict: no verdict yet

Evidence for

None yet.

Evidence against

None yet.

New papers that mention this problem