English

Solution of the minimum modulus problem for covering systems

Number Theory 2016-05-04 v3 Combinatorics

Abstract

We answer a question of Erd\H{o}s by showing that the least modulus of a distinct covering system of congruences is no larger than 101810^{18}.

Cite

@article{arxiv.1307.0874,
  title  = {Solution of the minimum modulus problem for covering systems},
  author = {Bob Hough},
  journal= {arXiv preprint arXiv:1307.0874},
  year   = {2016}
}

Comments

Submitted version, comments welcome

R2 v1 2026-06-22T00:44:35.860Z