No label defined (Q4248094)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1295223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1295223 |
Statements
10 September 2000
0 references
binomial coefficients
0 references
divided powers
0 references
congruence
0 references
multinomial coefficients
0 references
factorial number
0 references
0.7902397513389587
0 references
0.7900233268737793
0 references
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\).
0 references