<?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="Continued fraction - Page 6 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=continued_fraction&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=continued_fraction&amp;p=7">3.Next</a>
</p>
<p>continued fraction is convergent and has a definite value. If the sequence of convergents never approaches a limit, the continued fraction is divergent. It may diverge by oscillation (for example, the odd and even convergents may approach two different limits), or it may produce an infinite number of zero denominators .</p>

<p><big> History </big></p>
<p>The story of continued fractions begins with the <a href="page.php?w=Euclidean_algorithm">Euclidean algorithm</a>, a procedure for finding the <a href="page.php?w=greatest_common_divisor">greatest common divisor</a></p><p>
<a accesskey="1" href="page.php?w=continued_fraction&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=continued_fraction&amp;p=7">3.Next</a>
</p>

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

</card>
</wml>
