<?xml version="1.0" encoding="utf-8" ?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
         xmlns:dc="http://purl.org/dc/elements/1.1/"
         xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
         xmlns="http://purl.org/rss/1.0/">




    



<channel rdf:about="http://www.agapow.net/programming/python/euler/contents/RSS">
  <title>Project Euler</title>
  <link>http://www.agapow.net</link>
  
  <description>
    
       The Euler exercises implemented in Python.
       
  </description>
  
  
  
            <syn:updatePeriod>daily</syn:updatePeriod>
            <syn:updateFrequency>1</syn:updateFrequency>
            <syn:updateBase>2008-07-17T04:00:23Z</syn:updateBase>
        
  
  <image rdf:resource="http://www.agapow.net/logomentteslabs.jpg"/>

  <items>
    <rdf:Seq>
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/001"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/002"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/003"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/004"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/005"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/006"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/007"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/008"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/009"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/010"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/015"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/016"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/017"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/020"/>
        
        
            <rdf:li rdf:resource="http://www.agapow.net/programming/python/euler/035"/>
        
    </rdf:Seq>
  </items>

</channel>

    <item rdf:about="http://www.agapow.net/programming/python/euler/001">        <title>001 - find the sum of all multiples</title>        <link>http://www.agapow.net/programming/python/euler/001</link>        <description>Find the sum of all the multiples of 3 or 5 below 1000.</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-17T13:22:21Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/002">        <title>002 - find the sum of the fibonacci sequence</title>        <link>http://www.agapow.net/programming/python/euler/002</link>        <description>Find the sum of all the even-valued terms in the Fibonacci sequence which do not exceed one million.</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-17T13:22:22Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/003">        <title>003 - prime factors</title>        <link>http://www.agapow.net/programming/python/euler/003</link>        <description>Find the largest prime factor of 317584931803.</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-17T13:22:22Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/004">        <title>004 - palindromic numbers</title>        <link>http://www.agapow.net/programming/python/euler/004</link>        <description>Find the largest palindrome made from the product of two 3-digit numbers.</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-17T13:22:22Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/005">        <title>005 - evenly divisible</title>        <link>http://www.agapow.net/programming/python/euler/005</link>        <description>What is the smallest number that is evenly divisible by all of the numbers from 1 to 20?</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-17T13:22:22Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/006">        <title>006 - sum of squares less square of sums</title>        <link>http://www.agapow.net/programming/python/euler/006</link>        <description>Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-17T13:22:22Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/007">        <title>007 - 10001st prime</title>        <link>http://www.agapow.net/programming/python/euler/007</link>        <description>What is the 10001st prime number?</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-17T13:22:22Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/008">        <title>008 - paths across grid</title>        <link>http://www.agapow.net/programming/python/euler/008</link>        <description>Find the greatest product of five consecutive digits in a 1000-digit number.</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-17T13:22:22Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/009">        <title>009 - Pythagorean triplets</title>        <link>http://www.agapow.net/programming/python/euler/009</link>        <description>Find the Pythagorean triplet (a62 + b^2 = c^2) for which a + b + c = 1000.</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-21T09:22:27Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/010">        <title>010 - sum of primes</title>        <link>http://www.agapow.net/programming/python/euler/010</link>        <description>Find the sum of all the primes below one million.</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-21T09:23:02Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/015">        <title>015 - paths across grid</title>        <link>http://www.agapow.net/programming/python/euler/015</link>        <description>How many routes are there through a 20x20 grid?</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-21T09:23:22Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/016">        <title>016 - sum a power of 2</title>        <link>http://www.agapow.net/programming/python/euler/016</link>        <description>What is the sum of the digits of the number 2^1000?</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-21T09:23:48Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/017">        <title>017 - sum a power of 2</title>        <link>http://www.agapow.net/programming/python/euler/017</link>        <description>If all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used?</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-21T09:29:55Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/020">        <title>020 - sum factorial digits</title>        <link>http://www.agapow.net/programming/python/euler/020</link>        <description>Find the sum of the digits in the number 100!</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-21T09:31:27Z</dc:date>        <dc:type>Page</dc:type>    </item>
    <item rdf:about="http://www.agapow.net/programming/python/euler/035">        <title>035 - counting circular primes</title>        <link>http://www.agapow.net/programming/python/euler/035</link>        <description>How many circular primes (primes that when rotated are still primes) are there below one million?</description>        <dc:publisher>No publisher</dc:publisher>        <dc:creator>pma</dc:creator>        <dc:rights></dc:rights>                <dc:date>2008-07-21T09:30:37Z</dc:date>        <dc:type>Page</dc:type>    </item>




</rdf:RDF>
