<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Bijective proof - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=bijective_proof&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=bijective_proof&amp;p=3">3.Next</a>
</p>
<p>them with other sets that are easier to count. Additionally, the nature of the bijection itself often provides powerful insights into each or both of the sets.</p>

<p><big>Basic examples</big></p>
<p><big> Proving the symmetry of the binomial coefficients </big></p>
<p>The symmetry of the binomial coefficients states that</p>

<p>
:</p>

<p>This means that there are exactly as many <a href="page.php?w=combination">combination</a>s of  things in a set of size  as there are combinations of  things in a set of size&nbsp;.</p>

<p>The key idea of the bijective proof</p><p>
<a accesskey="1" href="page.php?w=bijective_proof&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=bijective_proof&amp;p=3">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
