Some congruence properties of binomial coefficients and linear second order recurrences
Using elementary methods, the following results are obtained:(I) If p is prime, 0≤m≤n, 0<b<apn−m, and p∤ab, then (apnbpm)≡(−1)p−1(apbn−m)(modpn); If r, s are the roots of x2=Ax−B, where (A,B)=1 and D=A2−4B>0, if un=rn−snr−s, vn=rn+sn, and k≥0, then (II) vkpn≡vkpn−1(modpn); (III) If p is odd...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1988-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171288000900 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|