Permutation conjecture for prime-exponent LCMs of distinct covering systems

A distinct covering system is a covering system whose moduli are distinct integers greater than 11. Let m2m\geq 2, let aa, bb, and cc be positive integers, and let LL denote the least common multiple of its moduli. For a permutation (a1,b1,c1)(a_1,b_1,c_1) of (a,b,c)(a,b,c) with a1b1c1a_1\geq b_1\geq c_1, the permutation conjecture. If there exists a distinct covering system with least modulus mm and

L=2a3b5c,L=2^a3^b5^c,

then there exists a distinct covering system with least modulus mm and

L=2a13b15c1.L=2^{a_1}3^{b_1}5^{c_1}.

The conjecture motivates restricting the analysis to exponents ordered as abca\geq b\geq c. The supplied text gives no resolution status.

Sources & referencesView supporting material

Primary source

Joshua Harrington, Jonah Klein, Joshua Lowrance and Ognian Trifonov, “Covering systems where the prime divisors of all moduli are only 2, 3, or 5”, arXiv:2605.18644 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.