Erdős Problem #390

A claim by Samuel Mausberg with GPT-5.5 Pro (2 May 2026) that has not yet been verified: candidate partial result.

Problem
Erdős problem #390 (number theory, factorials); current status: open (Lean)
Credit
Samuel Mausberg with GPT-5.5 Pro · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-05-02 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
UN-
VERIFIED
Per Tao's AI-contributions wiki

The problem

Let f(n)f(n) be the minimal mm such that

n!=a1⋯akn! = a_1\cdots a_k

with n<a1<⋯<ak=mn< a_1<\cdots <a_k=m. Is there (and what is it) a constant cc such that

f(n)−2n∼cnlog⁡n?f(n)-2n \sim c\frac{n}{\log n}?

Statement quoted from erdosproblems.com/390, maintained by Thomas Bloom. Original source: [ErGr80]. Current status there: open (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
2 May, 2026 AI working with humans GPT-5.5 Pro Samuel Mausberg ⚪ Candidate 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.

∎