Erdős problem 1190 · problems.science

Let $\epsilon_m=\max \sum \frac{1}{n_i}$ where the maximum is taken over all finite sequences $m<n_1<\cdots<n_k$ for which there exist congruences $a_i\pmod{n_i}$ such that no integer satisfies two such congruences.

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#1190
→
ResultNone
→
Checks0

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

Reported activity

Search problems.science