Printable View
if p is a prime number, prove that nCp = [n/p](mod p)
Looks like a variation of Fermats little theorem . . .
what if n=p^2?
