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

Erdős Problem #1062

Partial progress by Damek Davis with GPT-5.4 Pro (19 Apr 2026): partial result.

問題
Erdős problem #1062 (number theory); current status: open
貢献
Damek Davis with GPT-5.4 Pro · AI working with humans
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-04-19 · 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 f(n)f(n) be the size of the largest subset A⊆{1,…,n}A\subseteq \{1,\ldots,n\} such that there are no three distinct elements a,b,c∈Aa,b,c\in A such that a∣ba\mid b and a∣ca\mid c. How large can f(n)f(n) be? Is lim⁡f(n)/n\lim f(n)/n irrational?

Statement quoted from erdosproblems.com/1062, maintained by Thomas Bloom. Original source: [Gu04]. Current status there: open.

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
19 Apr, 2026 AI working with humans GPT-5.4 Pro Damek Davis 🟡 Partial result

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.

∎