<?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; Math</title>
	<atom:link href="http://freelancersunite.net/tag/math/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, 29 Jan 2012 23:42:31 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</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>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 #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 #68!</title>
		<link>http://freelancersunite.net/general/project-euler-problem-68/</link>
		<comments>http://freelancersunite.net/general/project-euler-problem-68/#comments</comments>
		<pubDate>Fri, 15 Jul 2011 14:44:58 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[General]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[pen and paper]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=976</guid>
		<description><![CDATA[Problem #68 boils down to: &#8230; By concatenating each group it is possible to form 9-digit strings; the maximum string for a 3-gon ring is 432621513. Using the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings. What is the maximum 16-digit string for a &#8220;magic&#8221; 5-gon [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/general/project-euler-problem-68/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #131!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-131/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-131/#comments</comments>
		<pubDate>Tue, 24 May 2011 16:19:53 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Math]]></category>
		<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=935</guid>
		<description><![CDATA[Problem #131 says: There are some prime values, p, for which there exists a positive integer, n, such that the expression \(n^{3} + n^{2}p\) is a perfect cube. For example, when \(p = 19, 8^{3} + 8^{2}×19 = 12^{3}\). What is perhaps most surprising is that for each prime with this property the value of [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-131/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #204!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-204/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-204/#comments</comments>
		<pubDate>Tue, 17 May 2011 02:39:33 +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=911</guid>
		<description><![CDATA[Problem #204 says: We will call a positive number a generalised Hamming number of type n, if it has no prime factor larger than n. Hence the Hamming numbers are the generalised Hamming numbers of type 5. How many generalised Hamming numbers of type 100 are there which don&#8217;t exceed 10^9? This is actually a [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-204/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #120!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-120/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-120/#comments</comments>
		<pubDate>Mon, 25 Apr 2011 23:41:41 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></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=917</guid>
		<description><![CDATA[So problem #120 says: Let r be the remainder when (a−1)^n + (a+1)^n is divided by a^2. For example, if a = 7 and n = 3, then r = 42: 6^3 + 8^3 = 728 ≡ 42 mod 49. And as n varies, so too will r, but for a = 7 it turns [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-120/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #203!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-203/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-203/#comments</comments>
		<pubDate>Tue, 15 Mar 2011 20:18:02 +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=903</guid>
		<description><![CDATA[Problem #203 says: A positive integer n is called squarefree if no square of a prime divides n. Of the twelve distinct numbers in the first eight rows of Pascal&#8217;s triangle, all except 4 and 20 are squarefree. The sum of the distinct squarefree numbers in the first eight rows is 105. Find the sum [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-203/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #104!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-104/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-104/#comments</comments>
		<pubDate>Tue, 15 Mar 2011 16:01:38 +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=896</guid>
		<description><![CDATA[Problem #104 says: Given that F(k) is the first Fibonacci number for which the first nine digits AND the last nine digits are 1-9 pandigital, find k. First of all the Fibonacci number F(k) is some 68 thousand digits long. It&#8217;s insane to try to and brute force this using a big int class and [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-104/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

