Erdős problem 387 · problems.science

Is there an absolute constant $c > 0$ such that, for all $1 \leq k < n$ , the binomial coefficient $\binom{n}{k}$ has a divisor in $(cn, n]$ ?

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:c1663e0cffe37594569d2633768b00b414033e9194a66e7dde59dd58586ccb27
Metadata: sha256:75a15d184b36e942d00323f12fb4bb383b7679413a3c6f6ef59c110cab0703ee
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:591b291b05433d6f42e4741dc0a111f32ffa3fc910534588321da8ee11e70374

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