Regenerated from the community database (Apache-2.0), dated, and linked back to it
from every problem. erdosproblems.com no longer shows statuses (Bloom's reasons); this is the database's record, not our verdict.
908 of 1221 statements are formalized in Lean (Formal Conjectures) · 107 carry an Erdős prize · 3 are independent of ZFC and 9 more can't be proved, or can't be disproved, from ZFC alone · “open” counts the computable and Lean-checked ones too.
Let \(F_{k}(N)\) be the size of the largest \(A\subseteq \{1,\ldots,N\}\) such that the product of no \(k\) many distinct elements of \(A\) is a square. Is \(F_5(N)=(1-o(1))N\)? Conjectured by Erdős, Sós, and Sárközy [ESS95], who proved…
What is the size of the largest \(A\subseteq \{1,\ldots,n\}\) such that if \(a\leq b\leq c\leq d\in A\) are such that \(abcd\) is a square then \(ad=bc\)? This was proved by GPT-5.5 Pro (prompted by Chojecki).
Source: teorth/erdosproblems (its own interactive table), Apache-2.0, pulled 2026-10-21. A status here is what that database records, not an independent verification by us, except where a problem page says so.