Binomial coefficient modulo a prime

  • Thread starter erszega
  • Start date
  • #1
36
0
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 ?
 

Answers and Replies

  • #2
matt grime
Science Advisor
Homework Helper
9,395
3
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 Threads on Binomial coefficient modulo a prime

  • Last Post
Replies
19
Views
5K
  • Last Post
Replies
6
Views
3K
  • Last Post
Replies
12
Views
3K
  • Last Post
Replies
4
Views
3K
Replies
7
Views
6K
Replies
2
Views
4K
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
1
Views
9K
  • Last Post
Replies
7
Views
5K
  • Last Post
Replies
2
Views
2K
Top