if p is a prime number, prove that nCp = [n/p](mod p)
Looks like a variation of Fermats little theorem . . .
"As far as the laws of mathematics refer to reality, they are not certain; and as far as they are certain, they do not refer to reality." - Albert Einstein It's turtles! And it's all the way down
what if n=p^2?
"bla, bla,... exists number M so for each n > M bla, bla..." Exists? Where is it? (Kronecker said...)
Forum Rules