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

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:bb6e45f482b0aeb1e88ec47458ee5f89c167bc46adb363ad32ff90bd1eff498e
Metadata
sha256:dc005342ace1ecff994e3693a212ef1935a824906eac584dda48c6dd46d237cd
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:1f5b739c893cbb5c449d1251d14fa42c3b7744245f5bf0bfcf6fe36ebbb1f7da
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page