Skip to content

Erdős Problem #1189

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, covering systems.

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 #1189 is OPEN — SEVERAL SUBCLAIMS in the maintained catalogue.

An irreducible covering set is a finite set of distinct moduli \(1<n_1<\cdots<n_k\) admitting some residues that cover all integers, but such that after removing any modulus no choice of new residues for remaining moduli can cover. Ask for the count \(I(k)\) of irreducible sets of size \(k\), bounds on smallest/largest possible largest modulus \(n_k\), the maximal reciprocal sum \(\sum_i1/n_i\), and whether infinitely many integers have their positive divisors \(>1\) form irreducible covering sets. The last is already resolved; the rest remains incompletely understood.

A small example

The divisors of 12 larger than one are \(\{2,3,4,6,12\}\). An exact search gives a covering assignment \((0\bmod2),(0\bmod3),(1\bmod4),(1\bmod6),(11\bmod12)\); exhaustive search over all new residue choices after removing each modulus shows that no proper subset of these moduli covers. This verifies irreducibility of this one modulus set. Its reciprocal sum is exactly \(4/3\), compatible with the necessary covering-density bound.

What is known

https://www.erdosproblems.com/1189 cites [Er80,p.95] and marks the omnibus problem OPEN. Sun [Su07] proves that for every odd prime \(p\), the divisors \(>1\) of \(2^{p-1}p\) form an irreducible covering set, settling the 'infinitely many integers' subquestion YES. Simpson [Si85] established a bound \(n_k\le2^{k-1}\) in the relevant context, and BBMST24 derived \(I(k)\le\exp((c+o(1))k^{3/2}/\sqrt{\log k})\) for an explicit-source constant. Count of irreducible sets of moduli differs from count of minimal residue assignments in #1188.

GCL's current state

Authenticated original issue research return records an exact statement audit, primary-source references and the bounded mathematical evidence. GCL independently replayed only ci/erdos_compendium_007_phase22_checks.py; it did not certify all original external proofs or resolve open problems. The current manuscript is UNACCEPTED.

What remains

Read Sun 2007, Simpson 1985 and BBMST24 primary sources to scope which of the four subquestions each solves; confirm the divisor example using an independent cyclic period proof, and separate \(I(k)\) from \(F(x)\) and \(G(x)\) indexing. Preserve OPEN for sharp counting and extremal reciprocal-sum questions.

Protected admission separately requires source fidelity and the predetermined independent critical-review gate. Finite verification does not satisfy that gate.

Sources and claim boundaries

https://www.erdosproblems.com/1189 ; [Er80,p.95],[Su07],[Si85],[BBMST24], #1188.

Persisted deterministic finite-check evidence is in governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE22.json. Original source issue body SHA unchanged; no public deployment, V2 approval or kernel certificate claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2460 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • 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