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$ ?

Sources

The source's own material, retained exactly.

1 retained statement36c6d0fef71a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

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