Erdős–Selfridge odd covering problem
Statement
A covering system of the integers is a finite family of congruence classes whose union is all of . The moduli are odd, distinct, and greater than when every is odd, the moduli are pairwise distinct, and for every .
Erdős–Selfridge odd covering problem. Does there exist a covering system of whose moduli are odd, distinct, and greater than ?
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 .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.