Erdős problem 684 · problems.science

For the least $k$ at which the small-prime part of $\binom{n}{k}$ exceeds $n^2$ , how large can $f(n)$ be?

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:5373310914a65608d8b8822fcadb490c9e5b488fb0362aa154824d0b8a3c0676
Metadata: sha256:f9a6900ebc29c2007aaba1ba345aea79a29b9ccb8181b5bf046709608fec9b71
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:e6fd37a103d67d250a4ec95af43e54ea1270b970ef53651cf5d2408efdc4bc8b

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