<?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="Combinatorics - Page 16 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=combinatorics&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=combinatorics&amp;p=17">3.Next</a>
</p>
<p><big>Enumerative combinatorics</big></p>
<p><a href="page.php?w=Image%3ACatalan_4_leaves_binary_tree_example.svg">320px</a></p>

<p>Enumerative combinatorics is the most classical area of combinatorics and concentrates on counting the number of certain combinatorial objects.  Although counting the number of elements in a set is a rather broad <a href="page.php?w=mathematical_problem">mathematical problem</a>, many of the problems that arise in applications have a relatively simple combinatorial description. <a href="page.php?w=Fibonacci_numbers">Fibonacci numbers</a></p><p>
<a accesskey="1" href="page.php?w=combinatorics&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=combinatorics&amp;p=17">3.Next</a>
</p>

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

</card>
</wml>
