A binomial coefficient congruence modulo prime powers (Q1208165)

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}}. \]