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.

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#379
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

  • AI building on literature

    Erdős AI contributions wiki · 21 Dec, 2025

    Machine
    Seed Prover 1.5
    Open the source record

Search problems.science

Find a Problem, Result, source, or page