<?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/category/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 #342!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-342/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-342/#comments</comments>
		<pubDate>Tue, 05 Jul 2011 15:16:36 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Math]]></category>
		<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c plus plus]]></category>
		<category><![CDATA[openmpi]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=958</guid>
		<description><![CDATA[Problem #342 says: Consider the number 50. \(50^{2} = 2500 = 2^{2} × 5^{4}\), so \(φ(2500) = 2 × 4 × 5^{3} = 8 × 5^{3} = 2^{3} × 5^{3}.\) So 2500 is a square and φ(2500) is a cube. Find the sum of all numbers n, 1 < n < \(10^{10}\) such that \(φ(n^{2})\) [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-342/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>Point in triangle testing.</title>
		<link>http://freelancersunite.net/software/point-triangle-testing/</link>
		<comments>http://freelancersunite.net/software/point-triangle-testing/#comments</comments>
		<pubDate>Thu, 06 Jan 2011 17:54:45 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Math]]></category>
		<category><![CDATA[Software]]></category>
		<category><![CDATA[f#]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=877</guid>
		<description><![CDATA[So according to my website stats people are ending up on this site after looking for the keywords &#8220;check if triangle contain the origin&#8221; (yeah I know that&#8217;s not good English but it&#8217;s what people enter into the search engine), no doubt looking for help with Project Euler Problem #102! (warning that link contains a [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/software/point-triangle-testing/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>FSharp Miller-Rabin primality test</title>
		<link>http://freelancersunite.net/math/fsharp-miller-rabin-primality-test/</link>
		<comments>http://freelancersunite.net/math/fsharp-miller-rabin-primality-test/#comments</comments>
		<pubDate>Wed, 21 Apr 2010 00:38:37 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Math]]></category>
		<category><![CDATA[.net4]]></category>
		<category><![CDATA[f#]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=688</guid>
		<description><![CDATA[In preparation for some upcoming project euler problems I&#8217;ve been looking for faster methods of determining if a number is prime. One such method I&#8217;ve come across was the Miller-Rabin primality test which is a probabilistic test for determining if a given number is probably prime. The higher the value of s passed to the [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/math/fsharp-miller-rabin-primality-test/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Lets talk math&#8230;.</title>
		<link>http://freelancersunite.net/math/lets-talk-math/</link>
		<comments>http://freelancersunite.net/math/lets-talk-math/#comments</comments>
		<pubDate>Sun, 26 Apr 2009 02:05:54 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Math]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=305</guid>
		<description><![CDATA[Okay, I&#8217;m writing this because a lot of people in my math class are having problems with this and because I still have (some) faith in humanity I&#8217;ll assume there difficulty is due to a lack of sources from which to learn. So today&#8217;s topic is &#8220;Inverse Functions&#8221;&#8230; So to start a inverse function &#8220;inverts&#8221; [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/math/lets-talk-math/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

