<?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>Free Lancers Unite &#187; programming</title>
	<atom:link href="http://freelancersunite.net/tag/programming/feed/" rel="self" type="application/rss+xml" />
	<link>http://freelancersunite.net</link>
	<description>&#34;look upon my works ye mighty and despair&#34;</description>
	<lastBuildDate>Fri, 16 Jul 2010 02:41:50 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Project Euler Problem #46!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-46/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-46/#comments</comments>
		<pubDate>Sun, 07 Feb 2010 07:13:21 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=627</guid>
		<description><![CDATA[Problem #46 says It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square. 9 = 7 + 2×1^(2) 15 = 7 + 2×2^(2) 21 = 3 + 2×3^(2) 25 = 7 + 2×3^(2) 27 = 19 + 2×2^(2) 33 = 31 [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-46/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #145!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-145/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-145/#comments</comments>
		<pubDate>Wed, 02 Dec 2009 04:44:36 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=602</guid>
		<description><![CDATA[Problem #145 says: Some positive integers n have the property that the sum [ n + reverse(n) ] consists entirely of odd (decimal) digits. For instance, 36 + 63 = 99 and 409 + 904 = 1313. We will call such numbers reversible; so 36, 63, 409, and 904 are reversible. Leading zeroes are not [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-145/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #50!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-50/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-50/#comments</comments>
		<pubDate>Thu, 05 Nov 2009 15:28:54 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=575</guid>
		<description><![CDATA[(updates on the site. pagerank just hit 3 on google. hopefully this will increase traffic a bit. and this post is the first post on the site done in windows 7 (took 6 hours for my pc to update ) Problem #50 says: The prime 41, can be written as the sum of six consecutive [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-50/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
