Identity

For discussing Olympiad Level Combinatorics problems
User avatar
Phlembac Adib Hasan
Posts:1016
Joined:Tue Nov 22, 2011 7:49 pm
Location:127.0.0.1
Contact:
Identity

Unread post by Phlembac Adib Hasan » Fri Nov 01, 2013 11:57 pm

Prove, by combinatorial arguments, for $1\leq m\leq k\leq n$, this identity holds.
\[\binom{n}{k}\binom{k}{m}=\binom{n}{m}\binom{n-m}{k-m}\]

User avatar
Fatin Farhan
Posts:75
Joined:Sun Mar 17, 2013 5:19 pm
Location:Kushtia,Bangladesh.
Contact:

Re: Identity

Unread post by Fatin Farhan » Sat Nov 02, 2013 8:43 am

Let $k$ be the number of all students, $n$ be the number of regional winners, $m$ be the number of national winners. We can choose regional winners from all participants in $\binom{n}{k}$ ways and national winners from regional winners in $\binom{k}{m}$ ways.
Again we can choose national winners from all participants in $\binom{n}{m}$ ways. As national winners are also regional winners, so rest of the regional winners can be chosen in $\binom{n-m}{k-m}$ ways.
So,$$\binom{n}{k}\binom{k}{m}=\binom{n}{m}\binom{n-m}{k-m}$$
"The box said 'Requires Windows XP or better'. So I installed L$$i$$nux...:p"

User avatar
Phlembac Adib Hasan
Posts:1016
Joined:Tue Nov 22, 2011 7:49 pm
Location:127.0.0.1
Contact:

Re: Identity

Unread post by Phlembac Adib Hasan » Sat Nov 02, 2013 10:09 am

Fatin Farhan wrote:Let $\color{red}{k}$ be the number of all students, $\color{red}{n}$ be the number of regional winners, $m$ be the number of national winners. We can choose regional winners from all participants in $\binom{n}{k}$ ways and national winners from regional winners in $\binom{k}{m}$ ways.
Again we can choose national winners from all participants in $\binom{n}{m}$ ways. As national winners are also regional winners, so rest of the regional winners can be chosen in $\binom{n-m}{k-m}$ ways.
So,$$\binom{n}{k}\binom{k}{m}=\binom{n}{m}\binom{n-m}{k-m}$$
$k\leq n$. উল্টাটা ধরতে হবে।
In your proof, LHS=regional winners$\times $ national winners=national winners $\times $ rest of the regional winners=RHS. Why should they be equal?
Welcome to BdMO Online Forum. Check out Forum Guides & Rules

User avatar
Zawadx
Posts:90
Joined:Fri Dec 28, 2012 8:35 pm

Re: Identity

Unread post by Zawadx » Tue Dec 03, 2013 9:24 pm

Phlembac Adib Hasan wrote:
Fatin Farhan wrote:Let $\color{red}{k}$ be the number of all students, $\color{red}{n}$ be the number of regional winners, $m$ be the number of national winners. We can choose regional winners from all participants in $\binom{n}{k}$ ways and national winners from regional winners in $\binom{k}{m}$ ways.
Again we can choose national winners from all participants in $\binom{n}{m}$ ways. As national winners are also regional winners, so rest of the regional winners can be chosen in $\binom{n-m}{k-m}$ ways.
So,$$\binom{n}{k}\binom{k}{m}=\binom{n}{m}\binom{n-m}{k-m}$$
$k\leq n$. উল্টাটা ধরতে হবে।
In your proof, LHS=regional winners$\times $ national winners=national winners $\times $ rest of the regional winners=RHS. Why should they be equal?
In LHS, we first find the ways of selecting regional winners from a pool of participants, and then find the ways of selecting national winners from those regional winners (this also creates a class of regional winners who aren't national winners). So ultimately we have the number of ways to select several regional winners (who aren't national winners), and some national winners (who are also regional winners).

In RHS, we find the ways of selecting national winners from participants, and then find the ways of selecting other regional winners (who are not national winners). Thus we conclude that LHS=RHS.

A bit redundant perhaps, but I think it's rigorous enough. :)

Post Reply