One item is filed under this topic.








Lucas' theorem 
20011009 

From Tania: How could I demonstrate: nCp is congruent to floor(n/p) (modulo p)? where rCk is a binomial coefficient, rCk = r(r1)...(rk+1)/k(k1)...1, and p is a prime number Answered by Richard McIntosh. 


