<?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; .net4</title>
	<atom:link href="http://freelancersunite.net/tag/net4/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 #57</title>
		<link>http://freelancersunite.net/general/project-euler-problem-57/</link>
		<comments>http://freelancersunite.net/general/project-euler-problem-57/#comments</comments>
		<pubDate>Thu, 06 May 2010 14:18:45 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=728</guid>
		<description><![CDATA[Problem #57 says: It is possible to show that the square root of two can be expressed as an infinite continued fraction. √ 2 = 1 + 1/(2 + 1/(2 + 1/(2 + &#8230; ))) = 1.414213&#8230; By expanding this for the first four iterations, we get: 1 + 1/2 = 3/2 = 1.5 1 [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/general/project-euler-problem-57/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>Random Snippets.</title>
		<link>http://freelancersunite.net/software/random-snippets/</link>
		<comments>http://freelancersunite.net/software/random-snippets/#comments</comments>
		<pubDate>Sat, 01 May 2010 20:00:32 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Software]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=713</guid>
		<description><![CDATA[Here are some random snippets of f# code I had lying around. mostly simple stuff for basic stats calculations. Not the most complex stuff but maybe its useful to somebody trying to learn f#. // Learn more about F# at http://fsharp.net open System open System.Net //basic arithmetic mean let Mean (x:List&#60;float&#62;) = let sum = [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/software/random-snippets/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>FSharp Miller-Rabin primality test</title>
		<link>http://freelancersunite.net/math/fsharp-miller-rabin-primality-test/</link>
		<comments>http://freelancersunite.net/math/fsharp-miller-rabin-primality-test/#comments</comments>
		<pubDate>Wed, 21 Apr 2010 00:38:37 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Math]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=688</guid>
		<description><![CDATA[In preparation for some upcoming project euler problems I&#8217;ve been looking for faster methods of determining if a number is prime. One such method I&#8217;ve come across was the Miller-Rabin primality test which is a probabilistic test for determining if a given number is probably prime. The higher the value of s passed to the [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/math/fsharp-miller-rabin-primality-test/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>
	</channel>
</rss>
