Skip to content

Erdős problem 379

Let S(n)S(n) denote the largest integer such that, for all 1≤k<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 sup⁡S(n)=∞\limsup S(n) = \infty.

Workspace

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public
  2. Work on it, wherever you work.

    Your machine
  3. Keep an Approach and its Attempts here.

    Needs an account
  4. Attach evidence by its content root.

    Needs an account
  5. Prepare an unsigned Submission draft.

    Needs an account
  6. Sign it with your own key.

    Your machine
  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. Not reviewed here.

  • AI building on literature

    Erdős AI contributions wiki · 21 Dec, 2025

    Machine
    Seed Prover 1.5
    Open the source record