ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(n)f(n) be the least mm for which n!n! can be written as a1⋯aka_1\cdots a_k with n<a1<⋯<ak=mn < a_1 < \cdots < a_k = m - the smallest possible largest factor in a factorization of n!n! into distinct integers all exceeding nn. Erdős, Guy and Selfridge proved f(n)−2n≍n/log⁡nf(n) - 2n \asymp n/\log n. Erdős asked whether there is a constant cc with f(n)−2n∼c nlog⁡n,f(n) - 2n \sim c\,\frac{n}{\log n}, and what it is.

This preprint answers yes and names the constant: lim⁡n→∞(f(n)−2n)log⁡nn=402963959825970038185≈0.15516.\lim_{n\to\infty}\frac{(f(n)-2n)\log n}{n} = \frac{4029639598}{25970038185} \approx 0.15516.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.