Skip to content

Erdős problem 392

Let A(n)A(n) denote the least value of tt such that n!=a1at n! = a_1 \cdots a_t with a1atn2a_1 \leq \cdots \leq a_t\leq n^2. Then A(n)=n2n2logn+o(nlogn). A(n) = \frac{n}{2} - \frac{n}{2\log n} + o\left(\frac{n}{\log n}\right).

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#392
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Search problems.science

Find a Problem, Result, source, or page