<?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>Aphoenix dot ca &#187; The Proof</title>
	<atom:link href="http://www.aphoenix.ca/category/left-brain/the-proof/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.aphoenix.ca</link>
	<description>music, technology, photography, family, food, love, hockey, pirates, code, math and anything else I want to stick in.</description>
	<lastBuildDate>Wed, 01 Feb 2012 15:58:54 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>Guelph Coffee and Code + Project Euler</title>
		<link>http://www.aphoenix.ca/guelph-coffee-and-code-project-euler-24/</link>
		<comments>http://www.aphoenix.ca/guelph-coffee-and-code-project-euler-24/#comments</comments>
		<pubDate>Thu, 24 Mar 2011 22:17:13 +0000</pubDate>
		<dc:creator>aphoenix</dc:creator>
				<category><![CDATA[Techgnostics]]></category>
		<category><![CDATA[The Proof]]></category>

		<guid isPermaLink="false">http://www.aphoenix.ca/?p=456</guid>
		<description><![CDATA[<p>I&#8217;m talking about Project Euler at tonight&#8217;s Guelph Coffee and Code. My talk is going to be short, but here&#8217;s the main talking points. Lenhard Euler: Mathematician Euler (pronounced &#8220;Canada&#8217;s Worst Hockey Team that&#8217;s not The Senators&#8221;) was a Mathematician &#8230; <a href="http://www.aphoenix.ca/guelph-coffee-and-code-project-euler-24/">Continue reading <span class="meta-nav">&#8594;</span></a></p>
]]></description>
			<content:encoded><![CDATA[<p>I'm talking about <a href="http://www.projecteuler.net">Project Euler</a> at tonight's <a href="http://www.guelphcoffeeandcode.org">Guelph Coffee and Code</a>. My talk is going to be short, but here's the main talking points.</p>
<h3>Lenhard Euler: Mathematician</h3>
<p>Euler (pronounced "Canada's Worst Hockey Team that's not The Senators") was a Mathematician in the 1700s. He was a genius, and he helped shape the world of mathematics that we know and love today. Check out <a href="http://en.wikipedia.org/wiki/Euler">Euler on Wikipedia</a> for more in depth info about the fellow.</p>
<h3>What's this all about?</h3>
<p>Project Euler is gets you to combine mathematical insights with computer programming in an effort to find answers to a series of over 300 problems. It's not tied to a particular language, though there are some languages that will serve you better than others. It's all about finding the answer in an elegant fashion.</p>
<h3>Why should I care?</h3>
<p>Project Euler will help you to identify areas of interest for you, and to make you a better all around programmer (and mathematician). There's a ton of different subjects that are covered, and it's an opportunity to push your self in new directions.</p>
<h3>Let's do an example!</h3>
<p>Sure thing! Look at Question #1.</p>
<blockquote><p>Add all the natural numbers below one thousand that are multiples of 3 or 5.</p></blockquote>
<p>Not hard right? Make a loop that goes from 1 to 1000, and for each number check if it's divisible by 3 or divisible by 5. If it is, add it to a running sum. Pseudocode looks something like this:</p>
<pre>
x=1
sum=0
while x is under 1001
    if x is a multiple of 3 then sum = sum + x
    if x is a multiple of 5 then sum = sum + x
</pre>
<p>And at the end return sum. Does that give the right answer? Are we forgetting something?</p>
<p>Of course, if x is a multiple of both 3 and 5, then we've counted it twice. We can fix that in a few ways, like subtracting off x one time if it's a multiple of 3 and 5.</p>
<pre>if x is a multiple of 3 and 5 then sum = sum - x</pre>
<p>Or we could just solve it with an else</p>
<pre>if x is a multiple of 3 then sum = sum + x
else if x is a multiple of 3 then sum = sum + x</pre>
<p>Now a lot of people will understand that the "trick" is not really tricky in this case. Remember not to count multiples of 3 and 5 twice is pretty simple. But the curve is pretty steep - after 20 or 30 questions, it's much more hidden.</p>
<p>And that's the gist of what I'm saying tonight.</p>
<p>By the way, here's that pseudocode in python:</p>
<pre>f=0
x=1
while x < 1000:
  if x%3==0:
    f=f+x
  elif x%5==0:
    f=f+x
  x=x+1
print f
</pre>
]]></content:encoded>
			<wfw:commentRss>http://www.aphoenix.ca/guelph-coffee-and-code-project-euler-24/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Exponential Growth</title>
		<link>http://www.aphoenix.ca/413-24/</link>
		<comments>http://www.aphoenix.ca/413-24/#comments</comments>
		<pubDate>Thu, 24 Jun 2010 12:52:30 +0000</pubDate>
		<dc:creator>aphoenix</dc:creator>
				<category><![CDATA[Left Brain]]></category>
		<category><![CDATA[The Proof]]></category>

		<guid isPermaLink="false">http://www.aphoenix.ca/?p=413</guid>
		<description><![CDATA[<p>According to the CBC G8/G20 costs have grown exponentially. I can only infer that if the first 3 days cost $1,000,000,000, then the next 3 days will cost $1,000,000,000,000,000,000 (the cost squared, typically the smallest of what is considered exponential &#8230; <a href="http://www.aphoenix.ca/413-24/">Continue reading <span class="meta-nav">&#8594;</span></a></p>
]]></description>
			<content:encoded><![CDATA[<p>According to the CBC <a href="http://www.cbc.ca/canada/story/2010/06/23/g8-g20-cost-parliamentary-budget-office-report.html">G8/G20 costs have grown exponentially</a>. I can only infer that if the first 3 days cost $1,000,000,000, then the next 3 days will cost $1,000,000,000,000,000,000 (the cost squared, typically the smallest of what is considered exponential growth). That's unfortunate, because I think that's more money than the entire world has, so we're probably all going to starve to death now.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.aphoenix.ca/413-24/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Project Euler</title>
		<link>http://www.aphoenix.ca/project-euler-23/</link>
		<comments>http://www.aphoenix.ca/project-euler-23/#comments</comments>
		<pubDate>Tue, 23 Mar 2010 21:23:08 +0000</pubDate>
		<dc:creator>aphoenix</dc:creator>
				<category><![CDATA[Left Brain]]></category>
		<category><![CDATA[Techgnostics]]></category>
		<category><![CDATA[The Proof]]></category>

		<guid isPermaLink="false">http://www.aphoenix.ca/?p=373</guid>
		<description><![CDATA[<p>I&#8217;m a latecomer to the Project Euler game, but I&#8217;m looking for a strong finish. I&#8217;ve been trying to hone my Python skills, so I Dove Into Python with a vengeance. That didn&#8217;t quite sate my desire for crazy coding &#8230; <a href="http://www.aphoenix.ca/project-euler-23/">Continue reading <span class="meta-nav">&#8594;</span></a></p>
]]></description>
			<content:encoded><![CDATA[<p>I'm a latecomer to the <a href="http://www.projecteuler.net">Project Euler</a> game, but I'm looking for a strong finish.</p>
<p>I've been trying to hone my Python skills, so I <a href="http://www.diveintopython.org">Dove Into Python</a> with a vengeance.  That didn't quite sate my desire for crazy coding fun, and my good buddy <a href="http://www.seanyo.ca">Sean</a> suggested the <a href="http://imranontech.com/2007/01/24/using-fizzbuzz-to-find-developers-who-grok-coding/">Infamous FizzBuzz test</a>.</p>
<p>Well, I loved it, and I searched for more similar problems, and I got to the first Project Euler question:</p>
<blockquote><p>If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.<br />
Find the sum of all the multiples of 3 or 5 below 1000.</p></blockquote>
<p>I was thrilled! A minor modification to my fizzbuzz program and I was off and running.  I've currently completed somewhere around 20... but I'll admit that I've skipped to the end am trying my hand at Problem 282, the dreaded Ackermann Function.</p>
<p>So - if you're a coder, why don't you try it out?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.aphoenix.ca/project-euler-23/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>If a picture&#8217;s worth 1000 words, then why can&#8217;t I eat you?</title>
		<link>http://www.aphoenix.ca/if-a-pictures-worth-1000-words-then-why-cant-i-eat-you-14/</link>
		<comments>http://www.aphoenix.ca/if-a-pictures-worth-1000-words-then-why-cant-i-eat-you-14/#comments</comments>
		<pubDate>Mon, 14 May 2007 14:56:06 +0000</pubDate>
		<dc:creator>aphoenix</dc:creator>
				<category><![CDATA[Confluence]]></category>
		<category><![CDATA[Lingua Franca]]></category>
		<category><![CDATA[The Proof]]></category>

		<guid isPermaLink="false">http://www.aphoenix.ca/if-a-pictures-worth-1000-words-then-why-cant-i-eat-you-14/</guid>
		<description><![CDATA[<p>We have often heard the old saw, &#8220;A picture is worth a thousand words.&#8221; Is that really true? Here are a few points to consider. We see at about 22 &#8211; 24 fps. Each individual frame that we see can &#8230; <a href="http://www.aphoenix.ca/if-a-pictures-worth-1000-words-then-why-cant-i-eat-you-14/">Continue reading <span class="meta-nav">&#8594;</span></a></p>
]]></description>
			<content:encoded><![CDATA[<p>We have often heard the old saw, "<em>A picture is worth a thousand words.</em>"  Is that really true?  Here are a few points to consider.</p>
<p>We see at about 22 - 24 <acronym title="frames per second">fps</acronym>.  Each individual frame that we see can be considered to be a picture.  If a picture is worth a thousand words, then we're taking in 22,000 to 24,000 words per second.</p>
<ul>
<li>A movie is something you watch, and almost flawless (for the purpose of being seen, not from any artistic point of view).</li>
<li>A movie is usually about 100 minutes (or so) long.</li>
</ul>
<p>From this, a moving picture is worth about 22 to 24 thousand words per second.  A full length <i>motion picture</i> or movie is worth between 132 and 144 million words.</p>
<p>To put that into perspective, "Moby Dick" had about 208,000 words.  "Atlas Shrugged" is about 645,000 words.</p>
<p>So, "Atlas Shrugged" would be worth about 10 minutes worth of a movie, using this formula.</p>
<p>I think that's a little bogus.  Let's look at it this way:</p>
<p>"Moby Dick" would be a pretty decent 2.5 hour movie (150 minutes).  (<i>Editor's Note - I realize that there are a few Moby Dick movies - 22, 77, 116 and 180 minute versions.  If I was making it, I would aim for 2.5 hours.  That's what I meant.  Plus, if I picked a different time, then it wouldn't prove my point!</i>)  That's about 1385 words per minute, or approximately 23 words per second.  Funny thing - didn't we say that a moving picture has 22 to 24 frames per second?</p>
<p>So, apparently, a picture is worth one word.</p>
<p><b>QED</b><br/>(<i>Editor's Note:  <b>QED</b> is an acronym that one puts at the end of a math problem.  It stands for Pancho Villa saying, "Questeeon Ees Done."  I considered posting this in a new category called "Lunacy" or possibly "Frivolity."</i>)</p>
]]></content:encoded>
			<wfw:commentRss>http://www.aphoenix.ca/if-a-pictures-worth-1000-words-then-why-cant-i-eat-you-14/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

