<?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; f#</title>
	<atom:link href="http://freelancersunite.net/tag/f/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, 12 Feb 2012 03:22:07 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</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 #108!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-108-110/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-108-110/#comments</comments>
		<pubDate>Wed, 12 Jan 2011 13:59:32 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=868</guid>
		<description><![CDATA[Problem #108 says: In the following equation x, y, and n are positive integers. \[ \frac {1}{x} + \frac {1}{y} = \frac{1}{n} \] What is the least value of n for which the number of distinct solutions exceeds one-thousand? NOTE: This problem is an easier version of problem 110; it is strongly advised that you [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-108-110/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Point in triangle testing.</title>
		<link>http://freelancersunite.net/software/point-triangle-testing/</link>
		<comments>http://freelancersunite.net/software/point-triangle-testing/#comments</comments>
		<pubDate>Thu, 06 Jan 2011 17:54:45 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Math]]></category>
		<category><![CDATA[Software]]></category>
		<category><![CDATA[f#]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=877</guid>
		<description><![CDATA[So according to my website stats people are ending up on this site after looking for the keywords &#8220;check if triangle contain the origin&#8221; (yeah I know that&#8217;s not good English but it&#8217;s what people enter into the search engine), no doubt looking for help with Project Euler Problem #102! (warning that link contains a [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/software/point-triangle-testing/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #78!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-78/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-78/#comments</comments>
		<pubDate>Thu, 06 Jan 2011 16:00:52 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=857</guid>
		<description><![CDATA[Problem #78 says: Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can separated into piles in exactly seven different ways, so p(5)=7. OOOOO OOOO O OOO OO OOO O O OO OO O OO O O O O O O O O [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-78/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #66!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-66/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-66/#comments</comments>
		<pubDate>Tue, 04 Jan 2011 18:11:19 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=855</guid>
		<description><![CDATA[Problem #66 says: Consider quadratic Diophantine equations of the form: x^(2) – Dy^(2) = 1 For example, when D=13, the minimal solution in x is 649^(2) – 13×180^(2) = 1. It can be assumed that there are no solutions in positive integers when D is square. By finding minimal solutions in x for D = [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-66/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #87!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-87/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-87/#comments</comments>
		<pubDate>Tue, 21 Dec 2010 20:35:33 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=847</guid>
		<description><![CDATA[Problem #87 says: The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, there are exactly four numbers below fifty that can be expressed in such a way: 28 = 2^(2) + 2^(3) + 2^(4) 33 = 3^(2) + 2^(3) + 2^(4) 49 = [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-87/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #85!</title>
		<link>http://freelancersunite.net/general/project-euler-problem-85/</link>
		<comments>http://freelancersunite.net/general/project-euler-problem-85/#comments</comments>
		<pubDate>Tue, 21 Dec 2010 15:43:48 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>
		<category><![CDATA[tuples]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=833</guid>
		<description><![CDATA[Problem #85 says: By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles; Although there exists no rectangular grid that contains exactly two million rectangles, find the area of the grid with the nearest solution. The project euler site has a nifty picture showing an example. This [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/general/project-euler-problem-85/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #76!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-76/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-76/#comments</comments>
		<pubDate>Tue, 21 Dec 2010 14:54:24 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[linux]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=827</guid>
		<description><![CDATA[Problem #76 says: It is possible to write five as a sum in exactly six different ways: 4 + 1 3 + 2 3 + 1 + 1 2 + 2 + 1 2 + 1 + 1 + 1 1 + 1 + 1 + 1 + 1 How many different ways can one [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-76/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>

