<?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>I like Chaos</title> <atom:link href="http://ilikechaos.co.uk/feed/" rel="self" type="application/rss+xml" /><link>http://ilikechaos.co.uk</link> <description>...and other mathematical objects</description> <lastBuildDate>Fri, 16 Sep 2011 20:24:10 +0000</lastBuildDate> <language>en</language> <sy:updatePeriod>hourly</sy:updatePeriod> <sy:updateFrequency>1</sy:updateFrequency> <item><title>Calculating the execution time of PHP scripts</title><link>http://ilikechaos.co.uk/2011/09/calculating-the-execution-time-of-php-scripts/</link> <comments>http://ilikechaos.co.uk/2011/09/calculating-the-execution-time-of-php-scripts/#comments</comments> <pubDate>Thu, 15 Sep 2011 23:30:46 +0000</pubDate> <dc:creator>admin</dc:creator> <category><![CDATA[Tools]]></category> <category><![CDATA[endtime]]></category> <category><![CDATA[execution time]]></category> <category><![CDATA[microtime]]></category> <category><![CDATA[mtime]]></category> <category><![CDATA[PHP]]></category> <category><![CDATA[php scripts]]></category> <category><![CDATA[processing time]]></category> <category><![CDATA[Project Euler]]></category> <category><![CDATA[Run time (computing)]]></category> <category><![CDATA[script execution]]></category> <category><![CDATA[starttime]]></category><guid
isPermaLink="false">http://ilikechaos.co.uk/?p=118</guid> <description><![CDATA[While working on the problems from Project Euler, my scripts were required to perform all the calculations under 1 minute, so I decided to look around for some snippets that would help me achieve just that. I found exactly what I wanted in two locations. First, in SNIPPLR&#8216;s library of scripts, I found one elegant [...]]]></description> <wfw:commentRss>http://ilikechaos.co.uk/2011/09/calculating-the-execution-time-of-php-scripts/feed/</wfw:commentRss> <slash:comments>0</slash:comments> </item> <item><title>Largest palindrome made from the product of two 3-digit numbers (P4)</title><link>http://ilikechaos.co.uk/2011/09/largest-palindrome-product-two-3-digit-numbers/</link> <comments>http://ilikechaos.co.uk/2011/09/largest-palindrome-product-two-3-digit-numbers/#comments</comments> <pubDate>Tue, 06 Sep 2011 09:00:54 +0000</pubDate> <dc:creator>admin</dc:creator> <category><![CDATA[Project Euler]]></category> <category><![CDATA[largest palindrome]]></category> <category><![CDATA[palindromic number]]></category> <category><![CDATA[PHP]]></category> <category><![CDATA[problem]]></category> <category><![CDATA[product of two 3-digit numbers]]></category><guid
isPermaLink="false">http://ilikechaos.co.uk/?p=79</guid> <description><![CDATA[What is a palindrome? A more formal definition of palindromicity is as follows: Consider a number n &#62; 0 in base b ≥ 2, where it is written in standard notation with k+1 digits ai as: n = sum(a[i]*b^i, i = 0 .. k) with 0 ≤ ai &#60; b ∀ i and ak ≠ 0.  Then n is palindromic if and only if ai = ak−i [...]]]></description> <wfw:commentRss>http://ilikechaos.co.uk/2011/09/largest-palindrome-product-two-3-digit-numbers/feed/</wfw:commentRss> <slash:comments>0</slash:comments> </item> <item><title>Largest prime factor of the number 600851475143 (P3)</title><link>http://ilikechaos.co.uk/2011/09/largest-prime-factor-number-600851475143/</link> <comments>http://ilikechaos.co.uk/2011/09/largest-prime-factor-number-600851475143/#comments</comments> <pubDate>Mon, 05 Sep 2011 04:43:08 +0000</pubDate> <dc:creator>admin</dc:creator> <category><![CDATA[Project Euler]]></category> <category><![CDATA[largest prime factor]]></category> <category><![CDATA[Millennium Prize Problems]]></category> <category><![CDATA[np problem]]></category> <category><![CDATA[PHP]]></category> <category><![CDATA[prime factorisation]]></category> <category><![CDATA[problem]]></category><guid
isPermaLink="false">http://ilikechaos.co.uk/?p=67</guid> <description><![CDATA[The next problem from the Euler project is an application of Prime factorisation. According to Wikipedia, &#8220;prime factorisation is the decomposition of a composite number into smaller non-trivial divisors, which when multiplied together equal the original integer&#8221;. One of the still unsolved problems in computer science is whether prime (or integer) factorisation can be done [...]]]></description> <wfw:commentRss>http://ilikechaos.co.uk/2011/09/largest-prime-factor-number-600851475143/feed/</wfw:commentRss> <slash:comments>0</slash:comments> </item> <item><title>Sum of even-valued terms in a Fibonacci sequence (P2)</title><link>http://ilikechaos.co.uk/2011/09/sum-even-valued-terms-fibonacci-sequence/</link> <comments>http://ilikechaos.co.uk/2011/09/sum-even-valued-terms-fibonacci-sequence/#comments</comments> <pubDate>Sun, 04 Sep 2011 05:23:08 +0000</pubDate> <dc:creator>admin</dc:creator> <category><![CDATA[Project Euler]]></category> <category><![CDATA[even-valued terms]]></category> <category><![CDATA[Fibonacci sequence]]></category> <category><![CDATA[PHP]]></category> <category><![CDATA[problem]]></category><guid
isPermaLink="false">http://ilikechaos.co.uk/?p=19</guid> <description><![CDATA[The second problem from the Euler project already appears to be slightly more difficult. It is given as follows: Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, [...]]]></description> <wfw:commentRss>http://ilikechaos.co.uk/2011/09/sum-even-valued-terms-fibonacci-sequence/feed/</wfw:commentRss> <slash:comments>0</slash:comments> </item> <item><title>Sum of all multiples of 3 or 5 less than 1000 (P1)</title><link>http://ilikechaos.co.uk/2011/09/sum-multiples-3-5-less-1000/</link> <comments>http://ilikechaos.co.uk/2011/09/sum-multiples-3-5-less-1000/#comments</comments> <pubDate>Sat, 03 Sep 2011 03:00:00 +0000</pubDate> <dc:creator>admin</dc:creator> <category><![CDATA[Project Euler]]></category> <category><![CDATA[PHP]]></category> <category><![CDATA[problem]]></category> <category><![CDATA[sum of multiples]]></category><guid
isPermaLink="false">http://ilikechaos.co.uk/?p=12</guid> <description><![CDATA[I&#8217;ve only recently discovered the Project Euler website, and I really like it. I find it hard to believe that it&#8217;s been around for 10 years now, and I haven&#8217;t had the faintest idea of its existence. Enough small talk, here is the first problem: If we list all the natural numbers below 10 that [...]]]></description> <wfw:commentRss>http://ilikechaos.co.uk/2011/09/sum-multiples-3-5-less-1000/feed/</wfw:commentRss> <slash:comments>0</slash:comments> </item> </channel> </rss><script type="text/javascript" src="http://stats.hosting24.com/count.php"></script>
<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Minified using disk: basic
Page Caching using disk: enhanced
Object Caching 391/469 objects using disk: basic

Served from: ilikechaos.co.uk @ 2013-05-19 03:13:19 -->