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).

Workspace

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public
  2. Work on it, wherever you work.

    Your machine
  3. Keep an Approach and its Attempts here.

    Needs an account
  4. Attach evidence by its content root.

    Needs an account
  5. Prepare an unsigned Submission draft.

    Needs an account
  6. Sign it with your own key.

    Your machine
  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. Not reviewed here.