<?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="Combination - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=combination&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=combination&amp;p=6">3.Next</a>
</p>

<p><big> Number of k-combinations </big></p>
<p>The number of k-combinations from a given set S of n elements is often denoted in elementary combinatorics texts by , or by a variation such as ,  , ,  or even  (the last form is standard in French, Romanian, Russian, and Chinese texts).  The same number however occurs in many other mathematical contexts, where it is denoted by  (often read as "n choose k"); notably it occurs as a coefficient in the <a href="page.php?w=binomial_formula">binomial formula</a>, hence its name binomial coefficient. One can define</p><p>
<a accesskey="1" href="page.php?w=combination&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=combination&amp;p=6">3.Next</a>
</p>

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

</card>
</wml>
