<?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>nimLog</title>
	<atom:link href="http://nimusi.net/blog/feed/" rel="self" type="application/rss+xml" />
	<link>http://nimusi.net/blog</link>
	<description>watching the world go by</description>
	<lastBuildDate>Fri, 15 Jul 2011 11:52:07 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
		<item>
		<title>My first Android app</title>
		<link>http://nimusi.net/blog/2011/07/my-first-android-app/</link>
		<comments>http://nimusi.net/blog/2011/07/my-first-android-app/#comments</comments>
		<pubDate>Fri, 15 Jul 2011 11:52:07 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[Android]]></category>
		<category><![CDATA[Java]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=521</guid>
		<description><![CDATA[I have been dabbling with Android development on and off for a little while now. Android apps are usually written in Java, and having never used Java before, I have had to teach myself the basics of Java. I wanted to start with a very basic app so I decided to convert an existing app [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2011/07/my-first-android-app/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Dragon Age</title>
		<link>http://nimusi.net/blog/2011/07/dragon-age/</link>
		<comments>http://nimusi.net/blog/2011/07/dragon-age/#comments</comments>
		<pubDate>Thu, 14 Jul 2011 13:37:32 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Games]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=517</guid>
		<description><![CDATA[I have recently been playing the CRPG (Computer Role Playing Game) Dragon Age. This was recommended to me by a reader of a previous post on RPGs. Incidentally Dragon Age has been written by Bioware, the team that created my favourite CRPG, Baldur&#8217;s Gate. I am completely hooked by the plot and game play of [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2011/07/dragon-age/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Calculating Permutations</title>
		<link>http://nimusi.net/blog/2010/08/calculating-permutations/</link>
		<comments>http://nimusi.net/blog/2010/08/calculating-permutations/#comments</comments>
		<pubDate>Sun, 22 Aug 2010 12:13:38 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=494</guid>
		<description><![CDATA[I recently came across this problem: Find the only 10 digit number which uses each of the digits 0 &#8211; 9 and has the following property: The number formed by the first n digits should be divisible by n. That is The first digit should be divisible by 1 The number formed by the first [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2010/08/calculating-permutations/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler: Problem 11</title>
		<link>http://nimusi.net/blog/2010/08/project-euler-problem-11/</link>
		<comments>http://nimusi.net/blog/2010/08/project-euler-problem-11/#comments</comments>
		<pubDate>Thu, 19 Aug 2010 08:04:12 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=458</guid>
		<description><![CDATA[This is problem 11 in Project Euler: In the 20 x 20 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2010/08/project-euler-problem-11/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler: Problem 10</title>
		<link>http://nimusi.net/blog/2010/08/project-euler-problem-10/</link>
		<comments>http://nimusi.net/blog/2010/08/project-euler-problem-10/#comments</comments>
		<pubDate>Thu, 12 Aug 2010 09:21:34 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=446</guid>
		<description><![CDATA[This is problem 10 on Project Euler: The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million. This is another problem where I cannot see any other solution than the brute-force approach of simply adding primes until we [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2010/08/project-euler-problem-10/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler: Problem 9</title>
		<link>http://nimusi.net/blog/2010/08/project-euler-problem-9/</link>
		<comments>http://nimusi.net/blog/2010/08/project-euler-problem-9/#comments</comments>
		<pubDate>Wed, 11 Aug 2010 08:56:00 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=419</guid>
		<description><![CDATA[This is Problem 9 on Project Euler: A Pythagorean triplet is a set of three natural numbers, a &#60; b &#60; c, for which, a2 + b2 = c2 For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly one Pythagorean triplet for which a + b + c [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2010/08/project-euler-problem-9/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Battles With the Android</title>
		<link>http://nimusi.net/blog/2010/08/battles-with-the-android/</link>
		<comments>http://nimusi.net/blog/2010/08/battles-with-the-android/#comments</comments>
		<pubDate>Tue, 10 Aug 2010 09:14:03 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[Android]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=346</guid>
		<description><![CDATA[As I have posted previously I am converting my PC application SecureIT to the Android smartphone platform. I am coding this in Java, and having never used Java before it is turning out to be an interesting project. The PC version of the app can work with multiple data files; these files can be quite [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2010/08/battles-with-the-android/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler: Problem 8</title>
		<link>http://nimusi.net/blog/2010/08/project-euler-problem-8/</link>
		<comments>http://nimusi.net/blog/2010/08/project-euler-problem-8/#comments</comments>
		<pubDate>Mon, 09 Aug 2010 08:00:02 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=311</guid>
		<description><![CDATA[Problem 8 in Project Euler is this Find the greatest product of five consecutive digits in the 1000-digit number. 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 65727333001053367881220235421809751254540594752243 52584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482 83972241375657056057490261407972968652414535100474 82166370484403199890008895243450658541227588666881 16427171479924442928230863465674813919123162824586 17866458359124566529476545682848912883142607690042 24219022671055626321111109370544217506941658960408 07198403850962455444362981230987879927244284909188 84580156166097919133875499200524063689912560717606 05886116467109405077541002256983155200055935729725 71636269561882670428252483600823257530420752963450 The brute-force approach to this problem would be to calculate the product of all the sets [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2010/08/project-euler-problem-8/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler: Problem 7</title>
		<link>http://nimusi.net/blog/2010/08/project-euler-problem-7/</link>
		<comments>http://nimusi.net/blog/2010/08/project-euler-problem-7/#comments</comments>
		<pubDate>Sun, 08 Aug 2010 08:48:22 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=275</guid>
		<description><![CDATA[This is problem 7 on Project Euler: By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number? Because we have already created a prime number generator this should be quite an easy problem. We simply create [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2010/08/project-euler-problem-7/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler: Problem 6</title>
		<link>http://nimusi.net/blog/2010/08/project-euler-problem-6/</link>
		<comments>http://nimusi.net/blog/2010/08/project-euler-problem-6/#comments</comments>
		<pubDate>Sat, 07 Aug 2010 10:52:06 +0000</pubDate>
		<dc:creator>nimusi</dc:creator>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Project Euler]]></category>

		<guid isPermaLink="false">http://nimusi.net/blog/?p=246</guid>
		<description><![CDATA[This is problem 6 on Project Euler: The sum of the squares of the first ten natural numbers is, 12 + 22 + &#8230; + 102 = 385 The square of the sum of the first ten natural numbers is, (1 + 2 + &#8230; + 10)2 = 552 = 3025 Hence the difference between [...]]]></description>
		<wfw:commentRss>http://nimusi.net/blog/2010/08/project-euler-problem-6/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

