scientific article; zbMATH DE number 1295223
For a fixed prime \(p\) denote by \(m_i\) the digits in the \(p\)-adic representation of an integer \(m\) such that \(m= \sum_{i\geq 0} m_i p^i\), \(0\leq m_i< p\). The author determines the smallest non-zero digit in the case that \(m\) is a factorial number or a binomial resp. multinomial coefficient. As main result he proves the congruence \[ ((a,b,\dots, l))\equiv (-p)^r \prod_{i\geq 0} \frac{(a+b+ \dots+ l)_i} {a_i! b_i!\dots l_i!} \pmod {p^{r+1}} \] where \(((a,\dots, l))\) denotes the multinomial coefficient \(\frac{(a+ b+\dots+ l)!} {a! b!\dots l!}\) for nonnegative integers \(a,\dots, l\).
- A binomial coefficient identity associated to a conjecture of Beukers
- On the digital representation of integers with bounded prime factors
- scientific article; zbMATH DE number 4210228 (Why is no real title available?)
- scientific article; zbMATH DE number 5671348 (Why is no real title available?)
- scientific article; zbMATH DE number 5139464 (Why is no real title available?)
- Cauchy-Type Congruences for Binomial Coefficients
- \(p\)-adic valuations of some sums of multinomial coefficients
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248094)