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]?
Retained from Formal Conjectures · not edited here
Formal statements
1 open · 3 solved
Erdős Problems says
solved
Decision here
No current contribution
Checks
0 checks · 4 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page