/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
[EGRS75] Erdős, P. and Graham, R. L. and Ruzsa, I. Z. and Straus, E. G.,
On the prime factors of $\binom{2n}{n}$. Math. Comp. 29 (1975), 83-92.
PDF
@[expose]publicsectionnamespaceErdos731
The least integer $m \geq 1$ such that $m \nmid \binom{2n}{n}$, denoted $A(n)$ in [EGRS75].
The set is nonempty, since it contains $\binom{2n}{n}+1$ (see leastNonDivisor_spec), so sInf
is the true minimum. The condition 0 < m excludes m = 0.
Find some reasonable function $f(n)$ such that, for almost all integers $n$, the least integer
$m$ such that $m\nmid \binom{2n}{n}$ satisfies
$$m\sim f(n).$$
Here "almost all" means natural density $1$, and $m \sim f(n)$ means that for every
$\varepsilon>0$ the set of $n$ with $|m/f(n)-1|<\varepsilon$ has density $1$.
A problem of Erdős, Graham, Ruzsa, and Straus [EGRS75], who say it is 'not hard to show that',
for almost all $n$, the minimal such $m$ satisfies
$$m=\exp((\log n)^{1/2+o(1)}).$$
[EGRS75, (8), p. 91] states this as: for every $\varepsilon>0$, for all $n$ outside a set of
density $0$, $\exp((\log n)^{1/2-\varepsilon}) < m < \exp((\log n)^{1/2+\varepsilon})$.