An asymptotic formula for a ‐th powers dividing binomial coefficients
Fix integer \(a\geq 2\) and \(\varepsilon>0\). Suppose that \(s_ a(n,d)\) is the largest integer \(s\) for which \(s^ a\) divides the binomial coefficient \({2n+d\choose n}\). The author proves that for \(n\) sufficiently large and \(| d|<n^{1/a}/(\log n)^{1+o(1)}\) we have \[ \log s_ a(n,d)\sim(2^{1/a}-2)2^{1-a} \zeta(1/a) n^{1/a}, \] where \(\zeta(s)\) is the Riemann zeta-function. This generalizes \textit{A. Sárkőzy's} famous result for the case \(a=2\) [J. Number Theory 20, 70-80 (1985; Zbl 0551.10002)].
- Prime power divisors of \({2n \choose n}\)
- On the order of prime powers dividing \({2n\choose n}\)
- On the exponent average of integer sequences
- ON DIVISIBILITY OF ${\fontsize{9}{11}\selectfont\Big(\!\!\begin{array}{c}n-i-1\\[2pt]i-1\end{array}\!\!\Big)}$ by i
- Asymptotic prime-power divisibility of binomial, generalized binomial, and multinomial coefficients
- Asymptotic factorial powers expansions for binomial and negative binomial reciprocals
This page was built for publication: An asymptotic formula for a ‐th powers dividing binomial coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024704)
