Erdős problem 793
Let be the largest with for distinct . Is for some constant ?
Sources
Retained excerpts/
VibeMathed
Retained source excerpt
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$?
Open exact source location