On some divisibility properties of 2nn

From MaRDI portal
Publication:5329205





\textit{L. Moser} [Can. Math. Bull. 6, 167--169 (1963; Zbl 0113.03606)] has proved that \(\binom{2n}{n} = \binom{2n}{n} \binom{2b}{b}\) has no solution. The present author proves the following result. Denote by \(g(m)\) the smallest integer \(n > m\) such that \(\binom{2m}{m} \mid \binom{2n}{n}\). Then for all \(m\), \(g(m) \geq 2m\), for \(m > m_0\), \(m^{1+c} < g(m) < (2m)^{\log m/\log 2}\) for a certain absolute constant \(c > 0\).











This page was built for publication: On some divisibility properties of \(\binom{2n}{n}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5329205)