<?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</title>
	<atom:link href="http://freelancersunite.net/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>Thu, 04 Mar 2010 16:46:15 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Project Euler Problem #69!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-69/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-69/#comments</comments>
		<pubDate>Thu, 04 Mar 2010 16:46:15 +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=659</guid>
		<description><![CDATA[Problem #69 says:

Euler&#8217;s Totient function, φ(n) [sometimes called the phi function], is used to determine the number of
numbers less than n  which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than
nine and relatively prime to nine, φ(9)=6.
Find the value of n ≤ 1,000,000 for [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-69/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #51!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-51/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-51/#comments</comments>
		<pubDate>Fri, 26 Feb 2010 18:39:28 +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=654</guid>
		<description><![CDATA[Problem #51 says:

By replacing the 1st digit of *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.
By replacing the 3rd and 4th digits of 56**3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-51/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #60!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-60/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-60/#comments</comments>
		<pubDate>Tue, 23 Feb 2010 04:53:09 +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=648</guid>
		<description><![CDATA[Problem #60 says:

The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-60/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #26!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-26/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-26/#comments</comments>
		<pubDate>Wed, 10 Feb 2010 01:41:52 +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=641</guid>
		<description><![CDATA[Note: This solution marks my completion of 1- 50 in the project euler problem set. bringing the total number of problems I&#8217;ve solved to 64. 
Problem #26 says

A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
    1/2	= 	0.5
  [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-26/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<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 + 2×1^(2)
It turns out that the conjecture [...]]]></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 #47!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-47/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-47/#comments</comments>
		<pubDate>Fri, 05 Feb 2010 20:05:06 +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=620</guid>
		<description><![CDATA[UPDATED: solution now faster.
Problem 47 says:

The first two consecutive numbers to have two distinct prime factors are:
14 = 2 × 7
15 = 3 × 5
The first three consecutive numbers to have three distinct prime factors are:
644 = 2² × 7 × 23
645 = 3 × 5 × 43
646 = 2 × 17 × 19.
Find the [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-47/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #142!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-142/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-142/#comments</comments>
		<pubDate>Sat, 26 Dec 2009 17:01:19 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=613</guid>
		<description><![CDATA[Problem #142 say:

Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares.

Now one can brute force this by looping over x, y and z. [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-142/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #112!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-112/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-112/#comments</comments>
		<pubDate>Fri, 04 Dec 2009 00:47:21 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=609</guid>
		<description><![CDATA[Problem #112 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 neither increasing nor [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-112/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 allowed [...]]]></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 #206!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-206/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-206/#comments</comments>
		<pubDate>Fri, 27 Nov 2009 01:25:23 +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=597</guid>
		<description><![CDATA[Problem #206 says:
Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0,
where each “_” is a single digit.
The range of number to check can be narrowed down with a calculator and some common sense. Then its just a square and check procedure. Solution is in c# and requires the .Net 4.0 framework for its [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-206/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
