Skip to content

Erdős problem 379

Let S(n)S(n) denote the largest integer such that, for all 1k<n1 ≤ k < n, the binomial coefficient (nk)\binom{n}{k} is divisible by pS(n)p^S(n) for some prime pp (depending on kk).Then lim supS(n)=\limsup S(n) = \infty.
Retained from Formal Conjectures · not edited here
Formal statements
1 solved
Erdős Problems says
proved (Lean)
Decision here
No current contribution
Checks
0 checks · 1 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