Multinomial coefficients modulo a prime

From MaRDI portal





Define the order and power of the multinomial coefficient \((j_1, \ldots, j_l)=(j_1+ \cdots+ j_l)!/(j_1! \cdots j_l!)\) to be \(l\) and \(j_1+ \cdots+ j_l,\) respectively, and let \(G(n,l,p)\) be the number of multinomial coefficients that are not divisible by a prime \(p\) and that have order \(l\) and power not larger than \(n.\) The author shows that \[ 0<q_{l,p}^{(r)}- \liminf_{n \rightarrow \infty} G(n,l,p)/ n^{\theta} \leq \frac{1}{\theta p^r} \biggl( 1+\frac{1}{p^r} \biggr)^{\theta-1}, \] for any integer \(r\), where \(\theta=\log_p(l,p-1)\) and \( q_{l,p}^{(r)}=\min_{p^r \leq n < p^{r+1}} G(n,l,p)/(n+1)^ {\theta}. \) He uses this inequality to approximate \(\liminf_{n \rightarrow \infty} G(n,l,p)/n^{\theta}\) for various values of \(l\) and \(p\).











This page was built for publication: Multinomial coefficients modulo a prime

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