Erdős Problem #1188
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 #1188 is OPEN — MANDATORY CRITICAL for the modern maintained-catalogue formulation. This is different from Erdős's original 1980 question on printed p. 95, which asks how many distinct covering systems can be packed with moduli mutually disjoint even across different systems, rather than counting individual minimal systems.
A distinct covering system consists of one congruence \(a_i\bmod n_i\) for each distinct modulus \(1<n_1<\dots<n_k\) whose union covers every integer. It is minimal if removing any of its actual congruences destroys coverage. Let \(F(x)\) count such minimal congruence assignments with all moduli \(\le x\); estimate its asymptotic growth. Crucially, a minimal system of congruences differs from an irreducible covering set of moduli: after deleting a modulus from an irreducible set, no replacement residue choices may restore coverage. Counting unrestricted nonminimal systems is a different, much easier, exponentially abundant problem.
A small example
The exact finite fixture considers only the allowed moduli \(\{2,3,4,6,8,12\}\), choosing either no congruence or one residue per modulus. It enumerates all 49,140 assignments over a period of 24 and finds 216 covering systems, of which 24 are minimal under removal of any original congruence. A specific minimal witness is \((0\bmod2),(0\bmod3),(1\bmod4),(1\bmod6),(11\bmod12)\). These are counts restricted to the chosen modulus family, emphatically not the global value \(F(12)\).
What is known
Maintained https://www.erdosproblems.com/1188 is OPEN for sharp \(F(x)\) [Er80,p.95]. Hough [Ho15] proved Erdős #2, implying \(F(x)\to\infty\). Balister–Bollobás–Morris–Sahasrabudhe–Tiba [BBMST24] yield \(F(x)\ge\exp((\log x)^{3-o(1)})\), versus trivial upper \(\exp(O(x\log x))\). This lower is much faster than the original 'very slowly' expectation. The site distinguishes \(G(x)\) counting irreducible modulus sets, with \(G(x)\le F(x)\). The BBMST source proof and correspondence between its counted objects and these minimal covering assignments need independent review.
Original-source discrepancy (critical correction, 2026-10-17). In A survey of problems in combinatorial number theory (1980), printed p. 95, Erdős asks for the maximum number \(j_x\) of distinct covering systems with no modulus repeated anywhere across the different systems, subject to a cutoff \(x\). That is a packing problem, not the modern catalogue's count \(F(x)\) of individual minimal covering systems. The maintained site's discussion explicitly acknowledges this difference and retains the adapted modern problem as an interesting question. By Hough's minimum-modulus theorem, every distinct covering system has at least one modulus at most a universal constant \(M\). Thus any family with pairwise-disjoint moduli across systems has at most \(M-1\) systems, since their small moduli must all differ and lie among \(\{2,\ldots,M\}\). The historic packing parameter is therefore uniformly bounded in \(x\); this does not bound modern \(F(x)\), which counts different minimal systems even when their moduli overlap. Exact parameter matching, the Hough citation and original wording remain subject to a distinct independent source-critical review.
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
Mandatory #1188 independent critical review: verify the literal historical packing question \(j_x\) on Erdős 1980 p. 95 versus the adapted maintained minimal-system count \(F(x)\); source-check the Hough minimum-modulus implication for historic \(j_x\); then review the modern \(F/G\) definitions and BBMST24; independently enumerate all residue choices for the six-modulus family and check the 24 minimal witnesses, including coverage and each removal. Prove or disprove the asymptotic lower conversion from parameter \(k\) to \(\log x\), with actual published theorem hypotheses. Leave APPROVE/REVISE pending independent nonauthor expert.
Protected admission separately requires source fidelity and the predetermined independent critical-review gate. Finite verification does not satisfy that gate.
Sources and claim boundaries
Adapted catalogue #1188, with explicit historical clarification; Erdős 1980, printed p. 95 (original packing question); [Ho15] minimum-modulus theorem; [BBMST24] adapted minimal-system estimate, related #1189 and #2. These are not interchangeable problem formulations.
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: #2459 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: FORMAL_SOURCE_REFRESH_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.