Congruence properties of ordinary and \(q\)-binomial coefficients (Q2527006)
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 3248983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Congruence properties of ordinary and \(q\)-binomial coefficients |
scientific article; zbMATH DE number 3248983 |
Statements
1967
0 references
Congruence properties of ordinary and \(q\)-binomial coefficients (English)
0 references
\(q\)-binomial coefficient
0 references
congruences
0 references
The \(q\)-binomial coefficient is defined by \(\begin{bmatrix} n \\ k \end{bmatrix} =(q)_n/(q)_k(q)_{n-k}\), where \((q)_n= (q^n-1) (q^{n-1}-1) \cdots (q-1)\), \((q)_0=1\). The principal object of the paper is to extend some well known results of Legendre, Kummer and Lucas for ordinary binomial coefficients to \(q\)-binomial coefficients. Let \(p\) denote a fixed prime and let \(q\) be a rational number \(a/b\), where both \(a\) and \(b\) are prime to \(p\). The author first determines the highest power of \(p\) dividing \((q)_n\) and then uses this to determine the highest power of \(p\) that divides \(\begin{bmatrix} n+r \\ r \end{bmatrix}\). This result is then generalized for the \(q\)-multinomial coefficient \[ (q)_m/(q)_{m_1}(q)_{m_2} \cdots (q)_{m_n} \quad(m_1+m_2+\cdots+m_n=m). \] As an analog of a theorem of Lucas, the author proves that if \(q\) belongs to the exponent \(e\pmod p\) and \[ n=a_0+e\left(a_1+a_2 p+\ldots+a_k p^{k-1}\right), \] \[ r=b_0+e\left(b_1+b_2 p+\ldots+b_k p^{k-1}\right) \] where \( 0\le a_0<e\), \(0 \le b_0<e\), \(0 \le a_j<p\), \(0 \leq b_j<p\) \((j=1, \ldots, k) \), then \[ \begin{bmatrix} n \\ r \end{bmatrix}\equiv \begin{bmatrix} a_0 \\ b_0 \end{bmatrix} \begin{pmatrix} a_1 \\ b_1 \end{pmatrix} \begin{pmatrix} a_2 \\ b_2 \end{pmatrix} \cdots \pmod p. \] In the remainder of the paper the author determines the smallest positive integer \(A\) such that \[ \begin{bmatrix} n+A \\ k \end{bmatrix} \equiv \begin{bmatrix} n \\ k \end{bmatrix} \pmod{p^r} \] for all integers \(k\) and \(r\), \(0 \le k \le n\), \(r\ge 1\). Also the corresponding results for ordinary binomial coefficients are stated.
0 references