<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>A Random Walk Through Idea Space: euler</title>
  <subtitle>Posts tagged with euler</subtitle>
  <id>http://www.thattommyhall.com</id>
  <link href="http://www.thattommyhall.com"/>
  <link href="http://www.thattommyhall.com/tag/euler/feed.xml" rel="self"/>
  <updated>2010-10-18T13:50:35+01:00</updated>
  <author>
    <name>thattommyhall</name>
  </author>
  <entry>
    <title>Infinite Prime Number Generator In Python</title>
    <link rel="alternate" href="http://www.thattommyhall.com/2010/10/18/prime-gen/"/>
    <id>http://www.thattommyhall.com/2010/10/18/prime-gen/</id>
    <published>2010-10-18T13:50:35+01:00</published>
    <updated>2016-06-05T02:27:23+01:00</updated>
    <author>
      <name>thattommyhall</name>
    </author>
    <summary type="html">I was looking at this article (The Genuine Sieve of Eratosthenes / PDF) about a common functional prime number generator that is mistakenly called the Sieve of Eratosthenes.

It is quite complicated, section 2 deals with the performance of the naive algorithm</summary>
  </entry>
  <entry>
    <title>Project Euler 39 </title>
    <link rel="alternate" href="http://www.thattommyhall.com/2008/04/12/project-euler-39/"/>
    <id>http://www.thattommyhall.com/2008/04/12/project-euler-39/</id>
    <published>2008-04-12T19:49:57+01:00</published>
    <updated>2016-06-05T02:27:23+01:00</updated>
    <author>
      <name>thattommyhall</name>
    </author>
    <summary type="html">If p is the perimeter of a right angle triangle with integral length
sides, {a,b,c}, there are exactly three solutions for p = 120.

{20,48,52}, {24,45,51}, {30,40,50}

For which value of p &amp;lt; 1000, is the number of solutions maximised?


You may remember</summary>
  </entry>
</feed>
