Solution of the minimum modulus problem for covering systems

Abstract

We answer a question of Erdos by showing that the least modulus of a distinct covering system of congruences is no larger than 1018.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…