Erdős Problem #793
Let $F(n)$ be the largest $A\subseteq\{1,\dots,n\}$ with $a\nmid bc$ for distinct $a,b,c\in A$. Is $F(n)=\pi(n)+(C+o(1))\,n^{2/3}(\log n)^{-2}$ for some constant $C$?
Exact FrontierDelta
Scope and record
Occurred: Jul 1, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: site-confirmed. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.
Canonical aliases: Erdős Problem #793 · Erdős #793 · Problem 793
Confidence: Not scored
Registry verification: site confirmed · announcement · resolved
Attribution
VibeMathed
registry · event recorded by
Przemek Chojecki
human · human collaborator
GPT-5.6 Sol
model · ai model contributor · OpenAI
Lineage and corrections
This event attributed to Przemek Chojecki
This event attributed to GPT-5.6 Sol