<?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>diehealthy.org &#187; math</title>
	<atom:link href="http://diehealthy.org/category/math/feed" rel="self" type="application/rss+xml" />
	<link>http://diehealthy.org</link>
	<description>The technopolitical world needs thinkerers.</description>
	<lastBuildDate>Sat, 28 Jan 2012 17:55:08 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>The Euclidean Algorithm</title>
		<link>http://diehealthy.org/math/euclidean-algorithm</link>
		<comments>http://diehealthy.org/math/euclidean-algorithm#comments</comments>
		<pubDate>Fri, 12 Oct 2007 21:11:37 +0000</pubDate>
		<dc:creator>adam</dc:creator>
				<category><![CDATA[math]]></category>
		<category><![CDATA[C]]></category>
		<category><![CDATA[Euclidean Algorithm]]></category>
		<category><![CDATA[GCD]]></category>

		<guid isPermaLink="false">http://diehealthy.org/math/euclidean-algorithm</guid>
		<description><![CDATA[Implementation of the Euclidean Algorithm for finding the Greatest Common Divisor of two integers. <a href="http://diehealthy.org/math/euclidean-algorithm">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
		<wfw:commentRss>http://diehealthy.org/math/euclidean-algorithm/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

