Skip to content

Erdős problem 387

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

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#387
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page