# binomial coefficient modulo a prime

by erszega
Tags: binomial, coefficient, modulo, prime
 P: 36 A question: Let bin(a,b) denote the binomial coefficient a! / ( b! (a - b)! ). Is it true that bin( 2p, p ) = 2 (mod p) if p is prime and p>=3 ?
 HW Helper Sci Advisor P: 9,395 Yes, it's fermat's little theorem: x^p=x mod p, for p a prime, hence (1+x)^2p = (1+x^p)^2 = 1+2x^p+x^{2p} mod p note your requirement on p>=3 is not necessary. 4 choose 2 =6 whcih is congruent to 2 mod 2 as well.

 Related Discussions Precalculus Mathematics Homework 5 Calculus & Beyond Homework 2 Linear & Abstract Algebra 19 Calculus & Beyond Homework 0 Introductory Physics Homework 2