<?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; mono</title>
	<atom:link href="http://freelancersunite.net/tag/mono/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 #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 #119!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-119/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-119/#comments</comments>
		<pubDate>Tue, 09 Aug 2011 14:46:15 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></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=1061</guid>
		<description><![CDATA[Problem #119 is looking for: The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 + 2 = 8, and 83 = 512. Another example of a number with this property is 614656 = 284. We shall define an to be the nth [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-119/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #133!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-133/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-133/#comments</comments>
		<pubDate>Fri, 05 Aug 2011 01:19:03 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></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=1046</guid>
		<description><![CDATA[Problem #133 says: A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k; for example, R(6) = 111111. Let us consider repunits of the form \(R(10^{n})\). Although R(10), R(100), or R(1000) are not divisible by 17, R(10000) is divisible by 17. Yet there is [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-133/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #98!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-98/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-98/#comments</comments>
		<pubDate>Thu, 21 Jul 2011 17:31:08 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=1002</guid>
		<description><![CDATA[Problem #98 asks us: By replacing each of the letters in the word CARE with 1, 2, 9, and 6 respectively, we form a square number: 1296 = \(36^{2}\). What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: 9216 = \(96^{2}\). We shall call CARE [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-98/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #86!</title>
		<link>http://freelancersunite.net/general/project-euler-problem-86/</link>
		<comments>http://freelancersunite.net/general/project-euler-problem-86/#comments</comments>
		<pubDate>Wed, 20 Jul 2011 17:13:02 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=998</guid>
		<description><![CDATA[Problem #86 says: A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the opposite corner. By travelling on the surfaces of the room the shortest &#8220;straight line&#8221; distance from S to F is 10 and the path is shown on the [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/general/project-euler-problem-86/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>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>
	</channel>
</rss>

