<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Sputsoft &#187; continued fraction</title>
	<atom:link href="http://sputsoft.com/blog/tag/continued-fraction/feed" rel="self" type="application/rss+xml" />
	<link>http://sputsoft.com/blog</link>
	<description>Mathematics and Computer Programming</description>
	<lastBuildDate>Sun, 25 Jul 2010 10:20:33 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
		<item>
		<title>The Stern-Brocot Tree of Fractions</title>
		<link>http://sputsoft.com/blog/2009/12/the-stern-brocot-tree-of-fractions.html</link>
		<comments>http://sputsoft.com/blog/2009/12/the-stern-brocot-tree-of-fractions.html#comments</comments>
		<pubDate>Fri, 04 Dec 2009 20:21:54 +0000</pubDate>
		<dc:creator>sput</dc:creator>
				<category><![CDATA[mathematics]]></category>
		<category><![CDATA[binary search tree]]></category>
		<category><![CDATA[continuant]]></category>
		<category><![CDATA[continued fraction]]></category>
		<category><![CDATA[Stern-Brocot tree]]></category>

		<guid isPermaLink="false">http://sputsoft.com/?p=998</guid>
		<description><![CDATA[Consider two fractions <span class="math">\frac{m_1}{n_1}</span> and <span class="math">\frac{m_2}{n_2}</span> with positive numerators and denominators. The fraction <span class="math">\frac{m_1+m_2}{n_1+n_2}</span> is called the <em>mediant</em> of <span class="math">\frac{m_1}{n_1}</span> and <span class="math">\frac{m_2}{n_2}</span>. It is straightforward to show that the mediant is placed numerically between the original fractions,

<div class="math">
\frac{m_1}{n_1} < \frac{m_2}{n_2} \quad \Rightarrow \quad \frac{m_1}{n_1} < \frac{m_1+m_2}{n_1+n_2} < \frac{m_2}{n_2}.
</div>

Consider now the following simple procedure [...]]]></description>
		<wfw:commentRss>http://sputsoft.com/blog/2009/12/the-stern-brocot-tree-of-fractions.html/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Continued Fractions and Continuants</title>
		<link>http://sputsoft.com/blog/2009/11/continued-fractions-and-continuants.html</link>
		<comments>http://sputsoft.com/blog/2009/11/continued-fractions-and-continuants.html#comments</comments>
		<pubDate>Tue, 10 Nov 2009 15:27:42 +0000</pubDate>
		<dc:creator>sput</dc:creator>
				<category><![CDATA[mathematics]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[continuant]]></category>
		<category><![CDATA[continued fraction]]></category>
		<category><![CDATA[Fibonacci number]]></category>
		<category><![CDATA[quadratic irrationality]]></category>

		<guid isPermaLink="false">http://sputsoft.com/?p=904</guid>
		<description><![CDATA[We will be considering continued fractions of the form

<div class="math">
a_0 + \displaystyle\frac{1}{a_1 + \displaystyle\frac{1}{\ddots + \displaystyle\frac{1}{a_{n-1} + \displaystyle\frac{1}{a_n}}}}
</div>

where the <span class="math">a_k</span>'s are real numbers called the partial quotients [...]]]></description>
		<wfw:commentRss>http://sputsoft.com/blog/2009/11/continued-fractions-and-continuants.html/feed</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
	</channel>
</rss>
