ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A covering system of the integers is a finite family of congruence classes ai(modni)a_i \pmod{n_i} whose union is all of Z\mathbb{Z}. The moduli are odd, distinct, and greater than 11 when every nin_i is odd, the moduli are pairwise distinct, and ni>1n_i>1 for every ii.

Erdős–Selfridge odd covering problem. Does there exist a covering system of Z\mathbb{Z} whose moduli are odd, distinct, and greater than 11?

The problem is open in both directions and is Erdős's problem #7. An odd covering system would have consequences for the reducibility of trinomials, and the paper gives a kernel-checked exclusion showing that any such covering would have least common multiple exceeding 1000010000.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.