Przemek Chojecki

The Second Term for Strongly 2-Primitive Sets

Let $F(n)$ be the largest size of a set $A\subseteq[1,n]$ such that $a\nmid bc$ whenever $a,b,c\in A$ and $a\notin\{b,c\}$, with $b$ and $c$ allowed to coincide. We prove \[ F(n)=\pi(n)+\left(\frac{27}{2}+o(1)\right)\frac{n^{2/3}}{(\log n)^2}. \] This determines the second-order constant conjectured by Erd\H{o}s; the upper bound keeps the leading constants in his multiplicative basis, while the lower bound packs scale-separated prime triples by proper edge-colourings.