<?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; FSharp.PowerPack</title>
	<atom:link href="http://freelancersunite.net/tag/fsharp-powerpack/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, 29 Jan 2012 23:42:31 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<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>
		<item>
		<title>Project Euler Problem #72!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-72/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-72/#comments</comments>
		<pubDate>Mon, 22 Mar 2010 19:59:33 +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=673</guid>
		<description><![CDATA[Problem #72 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-72/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #62!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-62/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-62/#comments</comments>
		<pubDate>Mon, 22 Mar 2010 02:36:50 +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=669</guid>
		<description><![CDATA[Problem #62 says: The cube, 41063625 (345^(3)), can be permuted to produce two other cubes: 56623104 (384^(3)) and 66430125 (405^(3)). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube. Find the smallest cube for which exactly five permutations of its digits are cube. The solution [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-62/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<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 [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-69/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

