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.

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:3566c08504155bd9919ac6ca38e92a4d0a546afac8ef7479b023737f7ac16e69
Metadata
sha256:54eeb31a0dcbc43cee7b24a3ff7c9b9e0f41ce41cee17f0464726ce36b08e01c
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:36e68351ec79d84075be312526d8fcfec53fb882c9853f1db7f6d090154f651f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page