Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Erdős-Selfridge problem with square-free moduli

Published 31 Jan 2019 in math.NT and math.CO | (1901.11465v1)

Abstract: A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of covering systems with distinct moduli was initiated by Erd\H{o}s in 1950, and over the following decades numerous problems were posed regarding their properties. One particularly notorious question, due to Erd\H{o}s, asks whether there exist covering systems whose moduli are distinct and all odd. We show that if in addition one assumes the moduli are square-free, then there must be an even modulus.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.