Erdős problem 451 · problems.science

Let $n_k$ be the least integer greater than $2k$ for which $\prod_{i=1}^k (n_k - i)$ has no prime factor in $(k, 2k)$ . How rapidly must $n_k$ grow?

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:a2f5a9c55e66df3dabc64996b6baacfc048efd05878828b822753810e6b979a4
Metadata: sha256:18240b165561d7a98822b98ea68d656dbacddd0f96a43c33f9b8f324ab0c0ea6
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:b815c194e7ad76177e15a1f9cd8d8e9290b2cbcea3303a90907c0893a4929342

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207