<?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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	>
<channel>
	<title>Comments on: Project Euler Problem #3 (R)</title>
	<atom:link href="http://www.theresearchkitchen.com/blog/archives/119/feed" rel="self" type="application/rss+xml" />
	<link>http://www.theresearchkitchen.com/blog/archives/119</link>
	<description>Rory Winston</description>
	<pubDate>Wed, 07 Jan 2009 05:19:41 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.7</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: The Research Kitchen Weblog &#187; Blog Archive &#187; Project Euler Problem #10 (R)</title>
		<link>http://www.theresearchkitchen.com/blog/archives/119/comment-page-1#comment-19661</link>
		<dc:creator>The Research Kitchen Weblog &#187; Blog Archive &#187; Project Euler Problem #10 (R)</dc:creator>
		<pubDate>Fri, 18 Jul 2008 23:34:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=119#comment-19661</guid>
		<description>[...] 10 asks us to find the sum of the prime numbers below 2*106. With the sieve() routine written for one of the earlier problems, this is easy: it [...]</description>
		<content:encoded><![CDATA[<p>[...] 10 asks us to find the sum of the prime numbers below 2*106. With the sieve() routine written for one of the earlier problems, this is easy: it [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
