<?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</title>
	<atom:link href="http://freelancersunite.net/tag/fsharp/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 #231!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-231/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-231/#comments</comments>
		<pubDate>Thu, 03 Nov 2011 23:52:42 +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=1080</guid>
		<description><![CDATA[Problem #231 says: The binomial coefficient \( ^{10}C_{3} = 120\). \(120 = 2^{3} \ 3 \ 5 = 2\ 2\ 2\ 3\ 5\), and \(2 + 2 + 2 + 3 + 5 = 14\). So the sum of the terms in the prime factorisation of \(^{10}C_{3}\) is 14. Find the sum of the terms [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-231/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Find The Divisors Of A Number From Its Prime Factorization.</title>
		<link>http://freelancersunite.net/math/find-divisors-number-prime-factorization/</link>
		<comments>http://freelancersunite.net/math/find-divisors-number-prime-factorization/#comments</comments>
		<pubDate>Thu, 15 Sep 2011 05:14:36 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Math]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=1076</guid>
		<description><![CDATA[The following code takes a number k and its distinct factors f and creates a SortedSet containing all of the divisors of that number. It does this by expanding the set of divisors but multiplying each member of the already known divisors by each prime factor and checking to make sure that the input number [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/math/find-divisors-number-prime-factorization/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sqlite in F#!</title>
		<link>http://freelancersunite.net/software/sqlite-f/</link>
		<comments>http://freelancersunite.net/software/sqlite-f/#comments</comments>
		<pubDate>Tue, 16 Nov 2010 04:09:47 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Software]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[fsharp]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[sqlite]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=802</guid>
		<description><![CDATA[So I found myself working on a small personal project in F# to gain more familiarity in the language when I decided the best way to solve my data storage needs would be a small local database file. So I went looking for ways to get sqlite into F# projects and couldn&#8217;t find a decent [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/software/sqlite-f/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 #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>
	</channel>
</rss>

