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

Erdős Problem #943

Partial progress by Przemek Chojecki with GPT-5.4 Pro (18 Mar 2026): partial result.

問題
Erdős problem #943 (number theory, powerful); current status: open
貢献
Przemek Chojecki with GPT-5.4 Pro · AI working with humans
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-03-18 · 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 AA be the set of powerful numbers (if p∣np\mid n then p2∣np^2\mid n). Is it true that

1A∗1A(n)=no(1)1_A\ast 1_A(n)=n^{o(1)}

for every nn?

Statement quoted from erdosproblems.com/943, maintained by Thomas Bloom. Original source: [Er76d]. 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
3 Feb-18 Mar, 2026 AI working with humans GPT-5.4 Pro Przemek Chojecki 🟡 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.

∎