|
One item is filed under this topic.
 |
|
|
|
|
|
|
|
|
Lucas' theorem |
2001-10-09 |
|
From Tania:
How could I demonstrate: nCp is congruent to floor(n/p) (modulo p)? where rCk is a binomial coefficient, rCk = r(r-1)...(r-k+1)/k(k-1)...1, and p is a prime number
Answered by Richard McIntosh. |
|
|
|
