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

Erdős Problem #1196

Full solution by GPT-5.4 Pro (13 Apr 2026). 2 AI contributions are recorded in all.

問題
Erdős problem #1196 (number theory, primitive sets); current status: proved (Lean)
貢献
GPT-5.4 Pro · AI on its own
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-04-13 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
完全解Per Tao's AI-contributions wiki

The problem

Is it true that, for any xx, if A⊂[x,∞)A\subset [x,\infty) is a primitive set of integers (so that no distinct elements of AA divide each other) then

∑a∈A1alog⁡a<1+o(1),\sum_{a\in A}\frac{1}{a\log a}< 1+o(1),

where the o(1)o(1) term →0\to 0 as x→∞x\to \infty?

Statement quoted from erdosproblems.com/1196, maintained by Thomas Bloom. Original source: [ESS68b][Er80,p.101]. Current status there: proved (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
13 Apr, 2026 AI on its own GPT-5.4 Pro — 🟢 Full solution
16 Apr, 2026 AI working with humans GPT-5.4 Thinking Nat Sothanaphan 🟢 Full solution (stronger than literature)

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.

∎