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

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

Is it true that in any finite colouring of \mathbb{N} there exist arbitrarily large finite A such that all sums and products of distinct elements in A are the same colour?

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

[OpenAI26] OpenAI, Monochromatic finite sums and products in the positive integers. OpenAI Math Release preprint (September 2026). github.com/openai/math

Verdict: no verdict yet

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

Evidence for

None yet.

Evidence against

None yet.