Skip to content

Erdős Problem #784

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 sieve with bounded reciprocal weight may leave many integers uncovered, but its formulation must exclude 1. The problem has different answers in the ranges C below, equal to, and above 1.

Given A subset [1,x] with sum_{a in A} 1/a<=C, ask for a polynomial-logarithmic lower bound on count of m<=x divisible by NO a. Literal input permits 1, and A={1} kills every m for C>=1. The mathematically intended nontrivial question therefore REQUIRES a>=2, not a silent historical substitution.

A small example

For x=12 and A={2,3}, the uncovered integers are 1,5,7,11. Conversely A={1} is admissible under the literal wording at C=1 and leaves zero survivors. The discrepancy is substantive.

Finite exact example: x=12 and A={2,3} with harmonic mass 5/6. Uncovered {1,5,7,11}, four out of 12. With A={1} mass=1 and zero uncovered. Union bound via counting at most floor(x/a) multiples proves the corrected lower bound x(1-C) for C<1.

What is known

Maintained https://www.erdosproblems.com/784, SOLVED, explicitly highlights the 1 loophole and defines corrected H_C(x) over A subset {2,...,floor x}. Reported: 0<C<1 union bound H_C(x)>=(1-C)x, C=1 H_1(x) asymp x/log x (Ruzsa lower, Saias upper), and fixed C>1 Weingartner [We25] H_C(x) asymp x^{exp(1-C)}/log x. These force polynomial-log conjecture false for C>1 but true for 0<C<=1. Original Weingartner 2025 Research in Number Theory paper "The Schinzel–Szekeres function", Ruzsa 1982 and Saias 1998 theorem texts not independently checked; distinguish source-backed secondary summaries from a proof replay.

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: Including divisor 1 creates a vacuity; corrected divisor domain >=2 has distinct C<1, C=1 and C>1 asymptotic regimes.

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: prove the simple union bound exactly, brute-force examples with a>=2 for x<=15, and check Weingartner original theorem's constant dependence and floor effects. Explicit editorial hold on original A containing 1 and on mixing corrected/literal statuses.

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 #784 and authenticated source-return record.
  • Pinned teorth/erdosproblems source commit 536408716724a2402bdfa7c1d764bf83d64a8c89 at data/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: #2055 — 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.

Back to catalogue · Compendium introduction