Skip to content

Erdős Problem #1210

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (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.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Erdős Problem #1210 currently has source status OPEN.

For \(A\subseteq[1,n)\) of pairwise coprime integers, ask whether there is an absolute \(O(1)\) such that

\[ \sum_{a\in A}\frac1{n-a}\le\sum_{p<n}\frac1p+O(1). \]

Pairwise coprimality concerns the \(a\)'s, not the shifted denominators \(n-a\). A sample where the left-hand side exceeds the bare prime harmonic sum does not refute an inequality with an unspecified additive constant uniform in \(n\).

A small example

For each \(n=5,\dots,14\), enumerate all \(2^{n-1}\) subsets of \(\{1,\dots,n-1\}\), impose pairwise \(\gcd=1\), and maximize the shifted reciprocal sum as an exact rational. For \(n=5\) the maximum is \(7/4\), attained by \(A=\{1,3,4\}\), with denominators \(4,2,1\). These bounded maxima supply no general constant and do not disprove the conjecture.

What is known

Maintained https://www.erdosproblems.com/1210 is OPEN [Er80,p.112]. Erdős warns his earlier [Er77c,p.64] formulation was not quite correct; the earlier statement concerns primes \(n<q_i\le m\) and shifted sums \(1/(q_i-n)\) with different parameters. Problems #460 and #950 are related but not identical. The main source-fidelity task is to avoid conflating these two versions.

GCL's current state

Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.

What remains

Read Er77c and Er80 originals, source-normalize allowable \(1\in A\) and parameter ranges, and seek a uniform shifted-reciprocal grouping argument. Independently verify small finite extrema; separate the sum of shifted reciprocals from a sum over primes in the earlier version.

Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.

Sources and claim boundaries

https://www.erdosproblems.com/1210 ; [Er77c,p.64],[Er80,p.112], #460,#950.

Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2481 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned 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