Erdős Problem #783
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (not automatically the live result).
Subject areas: number theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
A collection of pairwise coprime integers acts as a sieve: strike out all integers divisible by at least one member. Under a budget on the sum of reciprocal divisors, how few survivors are possible? Exact minimizers and asymptotic minimum counts are different questions.
Fix C>0 and N large. Take pairwise coprime A subset {2,...,N} with sum_{a in A}1/a <= C; minimize uncovered integers m<=N not divisible by any a. The historical proposal is an interval of consecutive large primes, whereas an ASYMPTOTIC minimum and the EXACT extremal set are different questions.
A small example
For N=10, the pairwise coprime sieving set {2,3} has reciprocal mass 5/6 and leaves exactly 1,5,7 uncovered. Including divisor 1 would destroy the meaningful minimization.
Finite model: N=10, A={2,3} gives reciprocal sum 5/6 and uncovered integers 1,5,7 (3 total), since multiples of 2 or 3 are removed; pairwise gcd(2,3)=1. A={2,4} is NOT admissible due to gcd 2. The 1 divisor is excluded; otherwise no uncovered numbers. The asymptotic theorem is not an exact optimizer for every finite N,C.
What is known
Maintained https://www.erdosproblems.com/783, SOLVED: attributes the asymptotic minimum (rho(exp C)+o(1))N to Terence Tao and an exact prime-tail minimizer for C<=log 2 to Chojecki. Hunter's finite perturbations refute unrestricted literal exact-optimality. Here rho denotes the Dickman–de Bruijn function, not Euler's totient. Tao's original proof and Chojecki's full primary argument were not independently fetched; treat attribution as secondary catalogue evidence.
GCL's current state
The original authenticated RESULT/1 source return has historical disposition STATUS_CONFLICT. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.
Source interpretation and unresolved mathematical qualification: Tao asymptotic Dickman rho result is distinct from literal finite-N prime-tail minimizer; small perturbations can break exact optimality.
The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.
What remains
Next: validate N=10 fixture and exhaustive finite pairwise-coprime families under rational C, compare to prime tails, then lock Tao and Chojecki primary proofs with fixed-C error quantifiers. Editorial hold on saying every exact minimizer is a prime interval.
Adversarial editorial checking must verify the original theorem hypotheses and examples and later inspect actual HTML/MathJax output. These prerequisites are not discharged by the existence of the draft.
Sources and claim boundaries
- Maintained Erdős Problem #783 and authenticated source-return record.
- Pinned teorth/erdosproblems source commit
536408716724a2402bdfa7c1d764bf83d64a8c89atdata/problems.yaml. Primary historical references are identified by their bibliography keys in the original return; any not directly inspected are explicitly unverified. - Source review: PARTIAL. Independent mathematical critical review: PENDING. Protected merge: NONE. Public browser MathJax: NOT VERIFIED. GCL theorem certification: NONE.
Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2054 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.