<?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; python</title>
	<atom:link href="http://freelancersunite.net/tag/python/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>Sun, 12 Feb 2012 03:22:07 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
		<item>
		<title>Project Euler Problem #243!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-243/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-243/#comments</comments>
		<pubDate>Tue, 17 Aug 2010 02:29:24 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[project euler]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=766</guid>
		<description><![CDATA[Problem #243 says: A positive fraction whose numerator is less than its denominator is called a proper fraction. For any denominator, d, there will be d−1 proper fractions; for example, with d = 12: 1/12 , 2/12 , 3/12 , 4/12 , 5/12, 6/12 , 7/12 , 8/12 , 9/12 , 10/12 , 11/12 . We shall [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-243/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #132!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-132/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-132/#comments</comments>
		<pubDate>Mon, 24 May 2010 02:58:19 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[project euler]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=733</guid>
		<description><![CDATA[Problem #132 says: A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k. For example, R(10) = 1111111111 = 11×41×271×9091, and the sum of these prime factors is 9414. Find the sum of the first forty prime factors of R(10^(9)). To solve this problem [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-132/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #188!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-188/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-188/#comments</comments>
		<pubDate>Thu, 19 Nov 2009 16:34:24 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[project euler]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=585</guid>
		<description><![CDATA[Problem #188 says: The hyperexponentiation or tetration of a number a by a positive integer b, denoted by a↑↑b or ^(b)a, is recursively defined by: a↑↑1 = a, a↑↑(k+1) = a^((a↑↑k)). Thus we have e.g. 3↑↑2 = 3^(3) = 27, hence 3↑↑3 = 3^(27) = 7625597484987 and 3↑↑4 is roughly 10^(3.6383346400240996*10^12). Find the last 8 [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-188/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

