<?xml version="1.0" encoding="iso-8859-1"?>
<rss version="2.0">
    <channel>
    <title>Project Euler Notes</title>
    <link>http://www.lostgeek.co.uk/</link>
    <description></description>
    <language>en-us</language>           
    <generator>Nucleus CMS v3.51</generator>
    <copyright>&#169;</copyright>             
    <category>Weblog</category>
    <docs>http://backend.userland.com/rss</docs>
    <image>
        <url>http://www.lostgeek.co.uk//nucleus/nucleus2.gif</url>
        <title>Project Euler Notes</title>
        <link>http://www.lostgeek.co.uk/</link>
    </image>
    <item>
    <title>Problem 2</title>
    <link>xml-rss2.php?itemid=7</link>
    <description><![CDATA[The Fibonacci sequence has been shown to match patterns found in natures, such as the spiral of a shell, and the arrangement seeds in a sunflower.<br />
 <img src="http://www.lostgeek.co.uk/media/1/20110102-leicbotgarden_fib.jpg" width="360" height="181" alt="Leicester Botanical Gardens - Fibonacci Tribute" title="Leicester Botanical Gardens - Fibonacci Tribute" /><br />
<i>Leicester Botanical Gardens - Fibonacci Garden</i><br />
<br />
Pretty straight forward once you've generated the sequence, check for even terms by mod(2) == 0<br />
<img src="http://www.lostgeek.co.uk/media/1/20110102-problem2code.jpeg" width="357" height="262" alt="Problem 2 Source" title="Problem 2 Source" />]]></description>
    <category>General</category>
    <comments>xml-rss2.php?itemid=7</comments>
    <pubDate>Sun, 2 Jan 2011 12:20:05 +0000</pubDate>
</item><item>
    <title>Problem 1</title>
    <link>xml-rss2.php?itemid=5</link>
    <description><![CDATA[Very straight forward, using modulus to check if each integer in the range 1..1000 is a multiple of 3 or 5.<img src="http://www.lostgeek.co.uk/media/1/20110101-problem1code.jpeg" width="356" height="196" alt="Problem 1 Source Code" title="Problem 1 Source Code" />]]></description>
    <category>General</category>
    <comments>xml-rss2.php?itemid=5</comments>
    <pubDate>Sat, 1 Jan 2011 23:16:42 +0000</pubDate>
</item><item>
    <title>Introduction</title>
    <link>xml-rss2.php?itemid=3</link>
    <description><![CDATA[This blog is my place to share my thoughts and solutions on the problems set on the <a href="http://projecteuler.net">Project Euler</a> website.  A site dedicated to setting challenging mathematical / programming problems that lead the participants to extend their knowledge and exercise the little grey cells as Poirot would say.<br />
<br />
I will not publish the answers to the problems, but I will publish behind cuts the source-code I've used and my thoughts on the questions.]]></description>
    <category>General</category>
    <comments>xml-rss2.php?itemid=3</comments>
    <pubDate>Sat, 1 Jan 2011 22:20:42 +0000</pubDate>
</item>
  </channel>
</rss>
