この記事の日本語版はまだありません。英語版を表示しています。

Erdős Problem #202

Full solution by Boon Suan Ho with GPT-5.4 Pro (23 Apr 2026). 2 AI contributions are recorded in all.

問題
Erdős problem #202 (covering systems); current status: solved (Lean)
貢献
Boon Suan Ho with GPT-5.4 Pro · AI working with humans
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-04-23 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
完全解Per Tao's AI-contributions wiki

The problem

Let n1<⋯<nr≤Nn_1<\cdots < n_r\leq N with associated ai(modni)a_i\pmod{n_i} such that the congruence classes are disjoint (that is, every integer is ≡ai(modni)\equiv a_i\pmod{n_i} for at most one 1≤i≤r1\leq i\leq r). How large can rr be in terms of NN?

Statement quoted from erdosproblems.com/202, maintained by Thomas Bloom. Original source: [Er61][Er65][Er65b][Er73][Er77c][Er80,p.96][ErGr80][Va99,1.29]. Current status there: solved (Lean).

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Humans Outcome
23 Apr, 2026 AI working with humans GPT-5.4 Pro Boon Suan Ho 🟢 Full solution
30 Apr, 2026 AI working with humans GPT-5.5 Pro Przemek Chojecki ⚪ Candidate full solution

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎