Erdős Problem 684

### What is the conjecture

https://www.erdosproblems.com/684

For $0\leq k\leq n$ write
$$\binom{n}{k} = uv$$
where the only primes dividing $u$ are in $[2,k]$ and the only primes dividing $v$ are in $(k,n]$.

Let $f(n)$ be the smallest $k$ such that $u>n^2$. Give bounds for $f(n)$.

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else