<?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; programming</title>
	<atom:link href="http://freelancersunite.net/tag/programming/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>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 #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>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>
		<item>
		<title>And now for something a little different.</title>
		<link>http://freelancersunite.net/software/different/</link>
		<comments>http://freelancersunite.net/software/different/#comments</comments>
		<pubDate>Sat, 25 Sep 2010 23:26:05 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[Software]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=782</guid>
		<description><![CDATA[So I was wandering the internet when I found an article about steganography, which is the art of hiding something in plain sight. Such as hiding a message inside a picture. Specifically the least significant bit method where you take the RGB color values of the pixel and set them based off a message in [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/software/different/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #46!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-46/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-46/#comments</comments>
		<pubDate>Sun, 07 Feb 2010 07:13:21 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=627</guid>
		<description><![CDATA[Problem #46 says It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square. 9 = 7 + 2×1^(2) 15 = 7 + 2×2^(2) 21 = 3 + 2×3^(2) 25 = 7 + 2×3^(2) 27 = 19 + 2×2^(2) 33 = 31 [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-46/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #145!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-145/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-145/#comments</comments>
		<pubDate>Wed, 02 Dec 2009 04:44:36 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=602</guid>
		<description><![CDATA[Problem #145 says: Some positive integers n have the property that the sum [ n + reverse(n) ] consists entirely of odd (decimal) digits. For instance, 36 + 63 = 99 and 409 + 904 = 1313. We will call such numbers reversible; so 36, 63, 409, and 904 are reversible. Leading zeroes are not [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-145/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #50!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-50/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-50/#comments</comments>
		<pubDate>Thu, 05 Nov 2009 15:28:54 +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[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=575</guid>
		<description><![CDATA[(updates on the site. pagerank just hit 3 on google. hopefully this will increase traffic a bit. and this post is the first post on the site done in windows 7 (took 6 hours for my pc to update ) Problem #50 says: The prime 41, can be written as the sum of six consecutive [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-50/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

