Congruency of binomial coefficient
- Tolaso J Kos
- Administrator
- Posts: 867
- Joined: Sat Nov 07, 2015 6:12 pm
- Location: Larisa
- Contact:
Congruency of binomial coefficient
Let $p$ be a prime number such that $n<p<2n$. Prove that:
$$\binom{2n}{n} \equiv 0 (\bmod p)$$
Ι don't have a solution.
$$\binom{2n}{n} \equiv 0 (\bmod p)$$
Ι don't have a solution.
Imagination is much more important than knowledge.
-
- Former Team Member
- Posts: 77
- Joined: Mon Nov 09, 2015 11:52 am
- Location: Limassol/Pyla Cyprus
- Contact:
Re: Congruency of binomial coefficient
Well, \[\binom{2n}{n} = \frac{(2n)!}{n!n!}.\] We have that $p|(2n!)$ as $p < 2n$, but $p \nmid (n!)^2$ as $p$ is prime and $p > n$. So $\binom{2n}{n} \equiv 0 \bmod p$.
Create an account or sign in to join the discussion
You need to be a member in order to post a reply
Create an account
Not a member? register to join our community
Members can start their own topics & subscribe to topics
It’s free and only takes a minute
Sign in
Who is online
Users browsing this forum: No registered users and 4 guests