<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: Division-free LCM</title>
	<atom:link href="http://osteele.com/archives/2007/07/division-free-lcm/feed" rel="self" type="application/rss+xml" />
	<link>http://osteele.com/archives/2007/07/division-free-lcm</link>
	<description>Languages of the real and artificial.</description>
	<pubDate>Tue, 02 Dec 2008 15:16:29 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
		<item>
		<title>By: gcd calculator!</title>
		<link>http://osteele.com/archives/2007/07/division-free-lcm#comment-315</link>
		<dc:creator>gcd calculator!</dc:creator>
		<pubDate>Sat, 05 Jul 2008 19:50:51 +0000</pubDate>
		<guid isPermaLink="false">http://osteele.com/2007/07/08/division-free-lcm#comment-315</guid>
		<description>Hi! I programmed an attractive online calculator that find the greatest common divisor(GCD) between two numbers. I will be happy, if you add the link in your blog. I hope that you and your visitors will enjoy!  
---
http://gcd.awardspace.com
---
bye!</description>
		<content:encoded><![CDATA[<p>Hi! I programmed an attractive online calculator that find the greatest common divisor(GCD) between two numbers. I will be happy, if you add the link in your blog. I hope that you and your visitors will enjoy!  <br />
&#8212;<br />
<a href="http://gcd.awardspace.com" rel="nofollow">http://gcd.awardspace.com</a><br />
&#8212;<br />
bye!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
