VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Precise statement
Erdős and Graham asked whether $\binom{n}{k}$ with $1 \le k \le n/2$ must always have a divisor $\le n$ that is close to $n$, meaning bigger than a fixed constant times $n$. Settled in both directions: true when $k$ is large enough as a function of $n$, but false in general, since there are $\binom{n}{k}$ with $k$ small compared to $n$ having no such divisor.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement
fidelity, correctness, priority, or novelty.
What AI did
ChatGPT 5.5 Pro
The disclosure is carefully scoped rather than blanket. The main ideas in the proof of Theorem 5.1 were developed in interactive sessions between the authors and ChatGPT 5.5 Pro, and some documents and code in the accompanying repository were generated with AI assistance. The authors separately used ChatGPT for literature searches and for spotting typos, and they state that all text in the paper is human-generated. The heavier half of the paper, a restricted covering problem attacked with sieve methods and exponential sum estimates, is presented as the authors' own.
arXiv preprint, not peer-reviewed. The authors credit the model with the main ideas of one theorem rather than the paper, so the bulk of the argument rests on ordinary refereeing.