Skip to content

Erdős problem 1190

Start work

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.

Workspace

Continue locallyOpen sourceSign in to contribute

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public

  2. Work on it, wherever you work.

    Your machine

  3. Keep an Approach and its Attempts here.

    Needs an account

  4. Attach evidence by its content root.

    Needs an account

  5. Prepare an unsigned Submission draft.

    Needs an account

  6. Sign it with your own key.

    Your machine

  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. 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