Skip to content

Erdős problem 684

For the least kk at which the small-prime part of (nk)\binom{n}{k} exceeds n2n^2, how large can f(n)f(n) be?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

No source in this release retained material for this Problem beyond its catalogue entry.

Reported activity

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

  • AI collaborating with humans

    Erdős AI contributions wiki · 2 Apr, 2026

    Machine
    GPT-5.4 Thinking
    People
    Nat Sothanaphan
    Open the source record
  • AI standalone

    Erdős AI contributions wiki · 31 Mar, 2026

    Machine
    OpenAI internal model
    Open the source record
  • AI collaborating with humans

    Erdős AI contributions wiki · 19 Jan, 2026

    Machine
    GPT-5.2 Thinking
    People
    Quanyu Tang
    Open the source record
  • argument

    VibeMathed

    Machine
    Model not publicly disclosed
    Reported outcome
    retracted
    Open the source record

Continue

Search problems.science

Find a Problem, Result, source, or page