Skip to content

Erdős problem 793

Let F(n)F(n) be the largest A{1,,n}A\subseteq\{1,\dots,n\} with abca\nmid bc for distinct a,b,cAa,b,c\in A. Is F(n)=π(n)+(C+o(1))n2/3(logn)2F(n)=\pi(n)+(C+o(1))\,n^{2/3}(\log n)^{-2} for some constant CC?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:b5b18adb42fa6066c88a3196af3d07a4e62b3b2a2ef41a35d859952699b3f44e
Metadata
sha256:51c28f1acfc843ce77c16241928bd7896614716e1e8be142fbaebbb507d9ac72
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:064bea2bc1fa11ce336e48a5be9d5a00429b65effa9043204bea9e54621a0aa8
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page