<?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>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>Project Euler Problem #124!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-124/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-124/#comments</comments>
		<pubDate>Fri, 12 Aug 2011 15:47:54 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></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=1070</guid>
		<description><![CDATA[Problem #124 wants us to: The radical of n, rad(n), is the product of distinct prime factors of n. For example, \(504 = 2^3 × 3^2 × 7\), so rad(504) = 2 × 3 × 7 = 42. Let E(k) be the kth element in the sorted n column; for example, E(4) = 8 and [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-124/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #123!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-123/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-123/#comments</comments>
		<pubDate>Thu, 28 Jul 2011 19:42:08 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></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=923</guid>
		<description><![CDATA[Problem #23 says: Let p(n) be the nth prime: 2, 3, 5, 7, 11, &#8230;, and let r be the remainder when \((p(n)-1)^{n}+(p(n)+1)^{n}\) is divided by p(n)2. For example, when n = 3, p(3) = 5, and 43 + 63 = 280 ≡ 5 mod 25. The least value of n for which the remainder [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-123/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #80!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-80/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-80/#comments</comments>
		<pubDate>Mon, 18 Jul 2011 11:48:44 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=984</guid>
		<description><![CDATA[Problem #80 is stated as: It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all. The square root of two is 1.41421356237309504880&#8230;, and the digital sum of the first [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-80/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #95!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-95/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-95/#comments</comments>
		<pubDate>Tue, 28 Jun 2011 18:10:05 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=920</guid>
		<description><![CDATA[Problem #95 says: The proper divisors of a number are all the divisors excluding the number itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As the sum of these divisors is equal to 28, we call it a perfect number. Interestingly the sum of the proper divisors of [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-95/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #204!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-204/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-204/#comments</comments>
		<pubDate>Tue, 17 May 2011 02:39:33 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></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=911</guid>
		<description><![CDATA[Problem #204 says: We will call a positive number a generalised Hamming number of type n, if it has no prime factor larger than n. Hence the Hamming numbers are the generalised Hamming numbers of type 5. How many generalised Hamming numbers of type 100 are there which don&#8217;t exceed 10^9? This is actually a [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-204/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #203!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-203/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-203/#comments</comments>
		<pubDate>Tue, 15 Mar 2011 20:18:02 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></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=903</guid>
		<description><![CDATA[Problem #203 says: A positive integer n is called squarefree if no square of a prime divides n. Of the twelve distinct numbers in the first eight rows of Pascal&#8217;s triangle, all except 4 and 20 are squarefree. The sum of the distinct squarefree numbers in the first eight rows is 105. Find the sum [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-203/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #104!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-104/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-104/#comments</comments>
		<pubDate>Tue, 15 Mar 2011 16:01:38 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></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=896</guid>
		<description><![CDATA[Problem #104 says: Given that F(k) is the first Fibonacci number for which the first nine digits AND the last nine digits are 1-9 pandigital, find k. First of all the Fibonacci number F(k) is some 68 thousand digits long. It&#8217;s insane to try to and brute force this using a big int class and [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-104/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>
	</channel>
</rss>

