Skip to content

Erdős problem 1190

Let ϵm=max⁡∑1ni\epsilon_m=\max \sum \frac{1}{n_i} where the maximum is taken over all finite sequences m<n1<⋯<nkm<n_1<\cdots<n_k for which there exist congruences ai(modni)a_i\pmod{n_i} such that no integer satisfies two such congruences.

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/1190.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1190.leanErdos1190.erdos_11902 linesExact file
∀ (ε : ℝ),  0 < ε → ∀ᶠ (m : ℕ) in Filter.atTop, scaleL m ^ (-1 - ε) < Erdos1190.eps m ∧ Erdos1190.eps m < scaleL m ^ (-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:1190
  • PLBY Lean proofsErdosProblems.Erdos1190

Reported activity

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

  • AI collaborating with humans

    Erdős AI contributions wiki · 23 Apr, 2026

    Machine
    GPT-5.4 Pro
    People
    Boon Suan Ho
    Open the source record

  • Formalization

    Erdős AI contributions wiki · 14 May, 2026

    Machine
    Unspecified
    Open the source record

  • AI collaborating with humans

    Erdős AI contributions wiki · 30 Apr, 2026

    Machine
    GPT-5.5 Pro
    People
    Przemek Chojecki
    Open the source record

  • argument

    VibeMathed

    Machine
    GPT-5.4 Pro
    People
    Boon Suan Ho
    Reported outcome
    resolved
    Open the source record

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page