Vela

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_37aec80d874a0239
vela reproduce examples/erdos-problems

formal

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

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 e001eef1de018af130d3afbc1bd807579da912d32acf62d549faf4887b106032

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.