<?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="Enumerative combinatorics - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Enumerative_combinatorics&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Enumerative_combinatorics&amp;p=5">3.Next</a>
</p>
<p>and frequently involves deriving a <a href="page.php?w=recurrence_relation">recurrence relation</a> or <a href="page.php?w=generating_function">generating function</a> and using this to arrive at the desired closed form.</p>

<p>Often, a complicated closed formula yields little insight into the behavior of the counting function as the number of counted objects grows. In these cases, a simple <a href="page.php?w=Asymptotic_analysis">asymptotic</a> approximation may be preferable.  A function  is an asymptotic approximation to  if  as . In this</p><p>
<a accesskey="1" href="page.php?w=Enumerative_combinatorics&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Enumerative_combinatorics&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
