erdős #204
Are there such that there is a covering system with moduli the divisors of which is 'as disjoint as possible'? That is, for all with there is an associated such that every integer is congruent to some , and if there is some integer withthen .
Worked, still open.
covering systems · solved · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsformal
AMS 5 · solved (literature)
theorem erdos_204 : answer(False) ↔ ∃ (n : ℕ) (a : ℕ → ℤ),
let D := {d : ℕ | d ∣ n ∧ d > 1}
(∀ x : ℤ, ∃ d ∈ D, x ≡ a d [ZMOD d]) ∧
(∀ d ∈ D, ∀ d' ∈ D, d ≠ d' → (∃ x : ℤ, x ≡ a d [ZMOD d] ∧ x ≡ a d' [ZMOD d']) →
Nat.gcd d d' = 1)formal-conjectures/204.lean ↗status
solved