<?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; c#</title>
	<atom:link href="http://freelancersunite.net/tag/c/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 #122!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-122/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-122/#comments</comments>
		<pubDate>Tue, 02 Aug 2011 15:21:22 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=1038</guid>
		<description><![CDATA[Problem #122 says: We shall define m(k) to be the minimum number of multiplications to compute \(n^{k}\); for example m(15) = 5. For 1 ≤ k ≤ 200, find ∑ m(k). This is a problem about finding Addition Chains that lead to the desired number in the fewest steps. Using the library code I posted [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-122/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Addition Chains</title>
		<link>http://freelancersunite.net/math/addition-chains/</link>
		<comments>http://freelancersunite.net/math/addition-chains/#comments</comments>
		<pubDate>Mon, 01 Aug 2011 17:39:11 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Math]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=1027</guid>
		<description><![CDATA[Addition Chains are paths or little sections of an Addition Tree. To build the tree start with the number 1. To this root add a new node for each ancestor + itself such that the value of the new node is the parent node + ancestor. Thus for the node 1 the new children nodes [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/math/addition-chains/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 #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 #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 #61!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-61/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-61/#comments</comments>
		<pubDate>Thu, 23 Jun 2011 14:45:52 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=946</guid>
		<description><![CDATA[Problem #61 asks Find the sum of the only ordered set of six cyclic 4-digit numbers for which each polygonal type: triangle, square, pentagonal, hexagonal, heptagonal, and octagonal, is represented by a different number in the set. There are several things to look out for when writing a solution to this problem. 1) If the [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-61/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

