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

Erdős Problem #401

Partial progress by Boris Alexeev, Kevin Barreto, Liam Price and Nat Sothanaphan with Aristotle and GPT-5.2 Pro (10 Jan 2026): full solution (Lean); solution to variant problem.

問題
Erdős problem #401 (number theory, factorials); current status: proved (Lean)
貢献
Boris Alexeev, Kevin Barreto, Liam Price and Nat Sothanaphan with Aristotle and GPT-5.2 Pro · AI working with humans
検証
Lean formalizationListed in Tao's wiki
経緯
First AI contribution 2026-01-10 · 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 there some function f(r)f(r) such that f(r)→∞f(r)\to \infty as r→∞r\to\infty, such that, for infinitely many nn, there exist a1,a2a_1,a_2 with

a1+a2>n+f(r)log⁡na_1+a_2> n+f(r)\log n

such that a1!a2!∣n!2n3n⋯prna_1!a_2! \mid n!2^n3^n\cdots p_r^n?

Statement quoted from erdosproblems.com/401, maintained by Thomas Bloom. Original source: [ErGr80,p.78]. 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
10-11 Jan, 2026 AI working with humans Aristotle, GPT-5.2 Pro Boris Alexeev, Kevin Barreto, Liam Price, Nat Sothanaphan 🟢 Full solution (Lean); solution to variant problem

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.

∎