Erdős Problem #586

Is there a covering system such that no two of the moduli divide each other?

#586: [ErGr80][Er96b][Er97][Er97c][Er97e]

number theory | covering systems

Asked by Schinzel, motivated by a question of Erdős and Selfridge (see [7]). The answer is no, as proved by Balister, Bollobás, Morris, Sahasrabudhe, and Tiba [BBMST22].

View the LaTeX source

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)

0 comments on this problem

Likes this problem	None
Interested in collaborating	None
Currently working on this problem	None
This problem looks difficult	None
This problem looks tractable	None

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #586, https://www.erdosproblems.com/586, accessed 2026-01-16