A binomial coefficient congruence modulo prime powers (Q1208165): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/jnth.1993.1002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JNTH.1993.1002 / rank | |||
Normal rank | |||
Latest revision as of 16:16, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A binomial coefficient congruence modulo prime powers |
scientific article |
Statements
A binomial coefficient congruence modulo prime powers (English)
0 references
16 May 1993
0 references
The authors deduce from the main result of \textit{K. S. Davis} and \textit{W. A. Webb} [Eur. J. Comb. 11, 229-233 (1990; Zbl 0704.11002)], that if \(p\) is a prime \(>3\) and \(0\leq a\), \(b<p^ s\) then \[ {{np^{r+s}+a} \choose{kp^{r+s}+b}}\equiv {{np^{[r/3]}} \choose{kp^{[r/3]}}}{a \choose b}\pmod {p^{r+1}}. \]
0 references
congruence modulo prime powers
0 references
binomial coefficients
0 references
Lucas' theorem
0 references
