Skip to content

Erdős problem 387

Start work

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

Erdős Problems records this as solved.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal4 retained
  4. Resolutionsolved
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it575 share a topic
Number Theory576Binomial Coefficients22
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources