Skip to content

Erdős problem 392

Let A(n)A(n) denote the least value of tt such that n!=a1⋯at n! = a_1 \cdots a_t with a1≤⋯≤at≤n2a_1 \leq \cdots \leq a_t\leq n^2. Then A(n)=n2−n2log⁡n+o(nlog⁡n). A(n) = \frac{n}{2} - \frac{n}{2\log n} + o\left(\frac{n}{\log n}\right).

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal3 retained
  4. Resolutionproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it575 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.