Skip to content

Erdős problem 204

Are there nn such that there is a covering system with moduli the divisors of nn which is 'as disjoint as possible'?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/204.lean

Formal Conjectures

FormalConjectures/ErdosProblems/204.leanErdos204.erdos_2045 linesExact file
False ↔  ∃ n a,    have 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']) → d.gcd d' = 1
SolvedProof has a holelean4external proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.

Proof manifests naming this Problem

  • Jayyhk Erdős Leanjayyhk:erdos:204
  • PLBY Lean proofsErdosProblems.Erdos204

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page