<?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</title>
	<atom:link href="http://freelancersunite.net/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 #91!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-91/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-91/#comments</comments>
		<pubDate>Sun, 12 Feb 2012 03:22:07 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=1115</guid>
		<description><![CDATA[Problem #91 says The points \(P (x_1, y_1)\) and \(Q (x_2, y_2)\) are plotted at integer co-ordinates and are joined to the origin, \(O(0,0)\), to form \(ΔOPQ\). There are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate lies between 0 and 2 inclusive; that is, \( 0 \leq x_1, [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-91/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #125!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-125/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-125/#comments</comments>
		<pubDate>Sun, 29 Jan 2012 23:42:31 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=1093</guid>
		<description><![CDATA[Problem #125 says The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: \(6^2 + 7^2 + 8^2 + 9^2 + 10^2 + 11^2 + 12^2\). There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-125/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<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 #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>
	</channel>
</rss>

