<?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; Project Euler</title>
	<atom:link href="http://freelancersunite.net/category/project_euler/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 #102!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-102/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-102/#comments</comments>
		<pubDate>Fri, 16 Jul 2010 02:41:50 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=760</guid>
		<description><![CDATA[Problem 102 says: Three distinct points are plotted at random on a Cartesian plane, for which -1000 ≤ x, y ≤ 1000, such that a triangle is formed. Consider the following two triangles: A(-340,495), B(-153,-910), C(835,-947) X(-175,41), Y(-421,-714), Z(574,-645) It can be verified that triangle ABC contains the origin, whereas triangle XYZ does not. This [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-102/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #71!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-71/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-71/#comments</comments>
		<pubDate>Thu, 08 Jul 2010 03:06:01 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=738</guid>
		<description><![CDATA[I&#8217;m just getting back into the swing of things here after a busy period between work, life and college. Anyways, Problem #71 says: Consider the fraction, n/d, where n and d are positive integers. If n]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-71/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 #75!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-75/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-75/#comments</comments>
		<pubDate>Wed, 05 May 2010 13:00:58 +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[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=722</guid>
		<description><![CDATA[Problem #75 says: It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples. 12 cm: (3,4,5) 24 cm: (6,8,10) 30 cm: (5,12,13) 36 cm: (9,12,15) 40 cm: (8,15,17) 48 cm: (12,16,20) [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-75/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #99!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-99/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-99/#comments</comments>
		<pubDate>Sat, 01 May 2010 23:59:45 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=717</guid>
		<description><![CDATA[Problem #99 says: Comparing two numbers written in index form like 2^(11) and 3^(7) is not difficult, as any calculator would confirm that 2^(11) = 2048 < 3^(7) = 2187. However, confirming that 632382^(518061) > 519432^(525806) would be much more difficult, as both numbers contain over three million digits. Using base_exp.txt (right click and &#8216;Save [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-99/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #73!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-73/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-73/#comments</comments>
		<pubDate>Tue, 27 Apr 2010 04:10:35 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=706</guid>
		<description><![CDATA[Problem #73 says: Consider the fraction, n/d, where n and d are positive integers. If n]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-73/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #58!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-58/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-58/#comments</comments>
		<pubDate>Mon, 26 Apr 2010 02:17:16 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=698</guid>
		<description><![CDATA[Problem #58 says: Starting with 1 and spiraling anticlockwise in the following way, a square spiral with side length 7 is formed. It is interesting to note that the odd squares lie along the bottom right diagonal, but what is more interesting is that 8 out of the 13 numbers lying along both diagonals are [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-58/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #146!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-146/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-146/#comments</comments>
		<pubDate>Sun, 25 Apr 2010 15:55:36 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[FSharp.PowerPack]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=692</guid>
		<description><![CDATA[Problem #146 says: The smallest positive integer n for which the numbers n^(2)+1, n^(2)+3, n^(2)+7, n^(2)+9, n^(2)+13, and n^(2)+27 are consecutive primes is 10. The sum of all such integers n below one-million is 1242490. What is the sum of all such integers n below 150 million? This problem is rather complicated to say the [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-146/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #74!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-74/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-74/#comments</comments>
		<pubDate>Sat, 27 Mar 2010 00:07:38 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[FSharp.PowerPack]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=684</guid>
		<description><![CDATA[Problem #74 says: The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145: 1! + 4! + 5! = 1 + 24 + 120 = 145 Perhaps less well known is 169, in that it produces the longest chain of numbers that link [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-74/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #113!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-113/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-113/#comments</comments>
		<pubDate>Tue, 23 Mar 2010 20:31:21 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[FSharp.PowerPack]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=679</guid>
		<description><![CDATA[Problem #113 says: Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468. Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420. We shall call a positive integer that is [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-113/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
