Erdős problem 684 · problems.science

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

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

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