Corroborate

Claim in Erdős problems that formal-conjectures marks solved

A published paper or arXiv preprint answers the main question of Erdős Problem #371 (theorem erdos_371 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/371.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):

Let P(n) denote the largest prime factor of n. Show that the set of n with P(n+1) > P(n) has density \frac{1}{2}. This was proved by an internal OpenAI model in September 2026 [OAI26a]; see the linked Lean proof.

References formal-conjectures lists for this problem (a starting point, not evidence):

Verdict: no verdict yet

formal-conjectures marks problem #371 as solved. Those pages say who settled it and how.

Evidence for

None yet.

Evidence against

None yet.