<?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>Devil&#039;s Night &#187; Mathematics</title>
	<atom:link href="http://foxdie.org/archives/category/mathematics/feed" rel="self" type="application/rss+xml" />
	<link>http://foxdie.org</link>
	<description>So many plans, so little time</description>
	<lastBuildDate>Tue, 04 May 2010 00:29:01 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Solve simultaneous equations with multi unknowns by Matlab</title>
		<link>http://foxdie.org/archives/285</link>
		<comments>http://foxdie.org/archives/285#comments</comments>
		<pubDate>Tue, 24 Nov 2009 21:49:16 +0000</pubDate>
		<dc:creator>FOX</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[matlab]]></category>

		<guid isPermaLink="false">http://foxdie.org/?p=285</guid>
		<description><![CDATA[I just happened to find that today
Assume you have following equations:

x+y = 2
y+z = 2
z+x = 2

These 3 equations yields out that:

x = 1
y = 1
z = 1

To solve these or more complex ones than these, Just enter following code in Matlab
[x,y,z] = solve ('(x+y)=(2)', '(y+z)=(2)','(z+x)=(2)','x,y,z')
Leave rest of the work to your computer.
]]></description>
		<wfw:commentRss>http://foxdie.org/archives/285/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The beauty of LaTex</title>
		<link>http://foxdie.org/archives/261</link>
		<comments>http://foxdie.org/archives/261#comments</comments>
		<pubDate>Thu, 17 Sep 2009 02:31:55 +0000</pubDate>
		<dc:creator>FOX</dc:creator>
				<category><![CDATA[Life]]></category>
		<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Tech]]></category>
		<category><![CDATA[academic]]></category>
		<category><![CDATA[latex]]></category>

		<guid isPermaLink="false">http://foxdie.org/?p=261</guid>
		<description><![CDATA[How can u do this on Office?


]]></description>
		<wfw:commentRss>http://foxdie.org/archives/261/feed</wfw:commentRss>
		<slash:comments>9</slash:comments>
		</item>
		<item>
		<title>Greatest Common Divisors</title>
		<link>http://foxdie.org/archives/187</link>
		<comments>http://foxdie.org/archives/187#comments</comments>
		<pubDate>Tue, 26 May 2009 19:32:35 +0000</pubDate>
		<dc:creator>FOX</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[common divisor]]></category>
		<category><![CDATA[division]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[number theory]]></category>

		<guid isPermaLink="false">http://foxdie.org/?p=187</guid>
		<description><![CDATA[Much of modern cryptography is built on the foundation of linear algebra and number theory. At the most basic level, Number theory is the study of natural numbers

Definition
Let a and b be integers with b != 0, We say that b divides a, or a is divisible by b, if there is an integer c [...]]]></description>
		<wfw:commentRss>http://foxdie.org/archives/187/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Discrete logarithm</title>
		<link>http://foxdie.org/archives/31</link>
		<comments>http://foxdie.org/archives/31#comments</comments>
		<pubDate>Thu, 07 May 2009 20:07:48 +0000</pubDate>
		<dc:creator>FOX</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[math]]></category>

		<guid isPermaLink="false">http://foxdie.org/?p=31</guid>
		<description><![CDATA[The discrete logarithm  was introduced by Diffie-Hellman Key Exchange. Let&#8217;s take a close look at this problem.

Example
Let&#8217;s pick up a prime number 7, then there will be a cyclic group Cn, when n = 2, C2 = {1, 2, 3, 4, 5, 6 ,}. Every element in this group is co-prime with 7, and there [...]]]></description>
		<wfw:commentRss>http://foxdie.org/archives/31/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
