Erdős problem 793 · problems.science

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Proof manifests naming this Problem

Jayyhk Erdős Leanjayyhk:erdos:793

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

argument
VibeMathed
Machine
GPT-5.6 Sol
People
Przemek Chojecki
Reported outcome
resolved
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Proof manifests naming this Problem

Reported activity

Continue

Search problems.science