Answers are grounded in this paper and cite their sources.
Theoretical study uncovers an exact fixed-parameter algorithm for extremal unions of residue classes in modular arithmetic, indicating a factoring-free resolution to Erdős Problem 278.
Let A = {n₁ < ⋯ < nᵣ} be a finite set of positive integers. Choose one residue class aᵢ mod nᵢ for each modulus and maximize the natural density of their union. This is the unsettled maximum-density half of Erdős Problem 278. We give an exact uniform characterization whose state space depends on r, not on the magnitudes of the moduli. To a residue tuple we attach the graph in which vertices i and j are adjacent precisely when aᵢ ≡ aⱼ (mod gcd(nᵢ,nⱼ)). Inclusion–exclusion makes the covered density a clique-weighted function of this graph. For every forced edge set, a finite-abelian-group kernel calculation counts compatible tuples by a Smith-normal-form lattice index. Boolean Möbius inversion then counts the tuples with each exact graph. Maximizing over the graphs with positive count gives the exact extremal density. The resulting factoring-free algorithm uses 2O(r²) poly(B) bit operations, where B is the binary input length. We also give an independent prime-power layer formula for the kernel counts, a reduction to gcd kernels, and a factorization over the connected components of the non-coprimality graph. The construction is compatible with known arithmetic-coloring and abelian-arrangement machinery; the contribution is its exact-stratum composition with the Erdős–Graham density objective. Research status: Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-use disclosure: AI-assisted tools supported literature search, computation, proof auditing, and manuscript preparation. The author remains responsible for all claims and the final text.
No takes yet. Share an insight, caveat, or question.
Alper Ferudun (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: