Congruences with binomial coefficients
✍ Scribed by Obláth, Richard
- Book ID
- 112976334
- Publisher
- Springer-Verlag
- Year
- 1934
- Tongue
- English
- Weight
- 178 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0370-0089
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For p prime and i < p, i # 0, (r;Ti) I (r + l)(r;l) (y) (mod p2). A parallel, but rather different congruence holds modulo p3. In 1878, kdouard Lucas gave an elegant result for computing binomial coefficients modulo a prime [1,2]. H is result is as follows.
Let q > 1 and m > 0 be relatively prime integers. We find an explicit period ν m (q) such that for any integers n > 0 and r we have whenever a is an integer with gcd(1 -(-a) m , q) = 1, or a ≡ -1 (mod q), or a ≡ 1 (mod q) and 2 | m, where n r m (a) = k≡r (mod m) n k a k . This is a further extensio
AND WilLiam WebB Department of Mathematics, Washington State Unicersity, Pullman, Washington 99164-3113 Communicated hy Hans Zassenhaus