<?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>My Brain and His Chain</title>
	<atom:link href="http://www.evouga.com/mybrainandhischain/?feed=rss2" rel="self" type="application/rss+xml" />
	<link>http://www.evouga.com/mybrainandhischain</link>
	<description>I am young and life is long and there is time to kill today</description>
	<lastBuildDate>Mon, 23 Jul 2012 18:37:30 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
		<item>
		<title>Sum of Egyptian Fractions</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=235</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=235#comments</comments>
		<pubDate>Mon, 23 Jul 2012 18:26:04 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[Random Math]]></category>

		<guid isPermaLink="false">http://www.evouga.com/mybrainandhischain/?p=235</guid>
		<description><![CDATA[A friend recently posed me the following question: for an integer , how many pairs of positive integers exist for which Call this number . Here is my solution. We will count the number of positive integers for which there exists a corresponding . First, note that a exists if and only if the numerator [...]]]></description>
				<content:encoded><![CDATA[<p>A friend recently posed me the following question: for an integer <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>, how many pairs of positive integers <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_2d05e1f15387f87456155cd96cc06235.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(a,b)" /></span><script type='math/tex'>(a,b)</script> exist for which</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_f4b165e7d21e2e94f8bd14407cd7b709.gif' style='vertical-align: middle; border: none;' class='tex' alt="\frac{1}{n} = \frac{1}{a} + \frac{1}{b}?" /></span><script type='math/tex;  mode=display'>\frac{1}{n} = \frac{1}{a} + \frac{1}{b}?</script></p></p>
<p>Call this number <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_616689e1da200035e42c847af789d4bb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="F(n)" /></span><script type='math/tex'>F(n)</script>. Here is my solution. We will count the number of positive integers <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_0cc175b9c0f1b6a831c399e269772661.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="a" /></span><script type='math/tex'>a</script> for which there exists a corresponding <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_92eb5ffee6ae2fec3ad71c777531578f.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="b" /></span><script type='math/tex'>b</script>.</p>
<p>First, note that a <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_92eb5ffee6ae2fec3ad71c777531578f.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="b" /></span><script type='math/tex'>b</script> exists if and only if the numerator of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_435bad26e4ce0c77685eba1d5a701331.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\frac{a-n}{an}" /></span><script type='math/tex'>\frac{a-n}{an}</script> cancels when the fraction is put into lowest terms, in other words, if and only if <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_672c2455c046dfe1040ed1c6105df1ed.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a-n\vert an" /></span><script type='math/tex'>a-n\vert an</script>.</p>
<p>&nbsp;</p>
<p><em>Lemma 1</em>: <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_616689e1da200035e42c847af789d4bb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="F(n)" /></span><script type='math/tex'>F(n)</script> is equal to the number of integers <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_752ee30b6604ea99664ece156c9f09de.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="a>n" /></span><script type='math/tex'>a>n</script> for which <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_92c7a9a451c0564f095cf127274082f4.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a-n \vert (a,n)^2" /></span><script type='math/tex'>a-n \vert (a,n)^2</script>, where <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_84ad125ddc1735f7bcb15268357990f4.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(a,n)" /></span><script type='math/tex'>(a,n)</script> denotes the greatest common divisor of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_0cc175b9c0f1b6a831c399e269772661.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="a" /></span><script type='math/tex'>a</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>.</p>
<p>To see this fact, write <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_e7190a3fb3b7873e9b7c739dedc42336.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a = x(a,n)" /></span><script type='math/tex'>a = x(a,n)</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_1d66b1c6efdd05b0cf8df2937fcb60f1.gif' style='vertical-align: middle; border: none; ' class='tex' alt="b = y(a,n)" /></span><script type='math/tex'>b = y(a,n)</script>. Then <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_019a832b54d9b78e93bafa75ee62d559.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(x-y) \vert x y (a,n)" /></span><script type='math/tex'>(x-y) \vert x y (a,n)</script>. Since <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9dd4e461268c8034f5c8564e155c67a6.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="x" /></span><script type='math/tex'>x</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_415290769594460e2e485922904f345d.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="y" /></span><script type='math/tex'>y</script> are relatively prime, <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_19d59c7d61b117f2865b20b59c8b70f7.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="x-y" /></span><script type='math/tex'>x-y</script> is relatively prime to both <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9dd4e461268c8034f5c8564e155c67a6.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="x" /></span><script type='math/tex'>x</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_415290769594460e2e485922904f345d.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="y" /></span><script type='math/tex'>y</script>, so <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_a7913a5dc1b9cd83686066364ed51b16.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(x-y)\vert (a,n)" /></span><script type='math/tex'>(x-y)\vert (a,n)</script>, or <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_239e66a8ea80e2b3f62120f5b07fcc28.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(a-n)\vert (a,n)^2." /></span><script type='math/tex'>(a-n)\vert (a,n)^2.</script></p>
<p>&nbsp;</p>
<p><em>Lemma 2</em>: <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_616689e1da200035e42c847af789d4bb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="F(n)" /></span><script type='math/tex'>F(n)</script> is equal to the number of integers <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_752ee30b6604ea99664ece156c9f09de.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="a>n" /></span><script type='math/tex'>a>n</script> for which <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_b2149a75a2d656ff7e4b705a50938032.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a-n \vert n^2" /></span><script type='math/tex'>a-n \vert n^2</script>.</p>
<p>We will show that this set of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_0cc175b9c0f1b6a831c399e269772661.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="a" /></span><script type='math/tex'>a</script>s and the set of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_0cc175b9c0f1b6a831c399e269772661.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="a" /></span><script type='math/tex'>a</script>s given by Lemma 1 are in bijection. First, if <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_5a9ab689b2b2f4fe03dfaf9dd4f9ca7f.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a-n\vert (a,n)^2" /></span><script type='math/tex'>a-n\vert (a,n)^2</script>, then clearly <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_dfe992a4330f19f3f3a3199dc3e1f5cb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a-n\vert n^2" /></span><script type='math/tex'>a-n\vert n^2</script> since <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_84ad125ddc1735f7bcb15268357990f4.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(a,n)" /></span><script type='math/tex'>(a,n)</script> is a divisor of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>.</p>
<p>Now suppose <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_04e8c8ccb87b55b7ffac91621b586f87.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(a-n)\vert n^2" /></span><script type='math/tex'>(a-n)\vert n^2</script>. Then <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_ee409d04a999a6a6de9e6a96dd83d71b.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="a-n" /></span><script type='math/tex'>a-n</script> is equal to a divisor <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8277e0910d750195b448797616e091ad.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="d" /></span><script type='math/tex'>d</script> of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_6595d679e306a127a3fe53268bcaddb2.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="n^2" /></span><script type='math/tex'>n^2</script>. We can write <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_faf989392511bde0a350403f347aef62.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d=d_1d_2" /></span><script type='math/tex'>d=d_1d_2</script> where <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_46c742646fcb0a9153d92e2fbe153ba6.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d_1\vert n" /></span><script type='math/tex'>d_1\vert n</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_616204f29a99b8a6d2e1d711aa1c997c.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d_2 \vert n" /></span><script type='math/tex'>d_2 \vert n</script>. Therefore both <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_03d3ca3fa2226c9a550d3f4cef0a1dd5.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d_1" /></span><script type='math/tex'>d_1</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8db9f9980d085b9184a30924aa6c6853.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d_2" /></span><script type='math/tex'>d_2</script> divide the right-hand side and so divide <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_0cc175b9c0f1b6a831c399e269772661.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="a" /></span><script type='math/tex'>a</script>, so both are common divisors of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_0cc175b9c0f1b6a831c399e269772661.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="a" /></span><script type='math/tex'>a</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script> and so <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_5681e429b0bf8194c08c70e7c60c2984.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d_1\vert (a,n)" /></span><script type='math/tex'>d_1\vert (a,n)</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8212086605a22628beca73450b32d1df.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d_2 \vert (a,n)" /></span><script type='math/tex'>d_2 \vert (a,n)</script>. Therefore <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_408ac5424586e922e11d94fb2763497f.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d_1d_2 \vert (a,n)^2" /></span><script type='math/tex'>d_1d_2 \vert (a,n)^2</script>.</p>
<p>Since for every divisor of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_6595d679e306a127a3fe53268bcaddb2.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="n^2" /></span><script type='math/tex'>n^2</script> we can solve for a unique <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_752ee30b6604ea99664ece156c9f09de.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="a>n" /></span><script type='math/tex'>a>n</script>, we have</p>
<p>&nbsp;</p>
<p><em>Answer:</em> <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_385fbe419cd5f961f22a695ee25ac10b.gif' style='vertical-align: middle; border: none; ' class='tex' alt="F(n) = d(n^2)" /></span><script type='math/tex'>F(n) = d(n^2)</script>, where the divisor function <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_6a0339d54403e41588f646cc16f8f3ec.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d(x)" /></span><script type='math/tex'>d(x)</script> counts the number of positive divisors of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9dd4e461268c8034f5c8564e155c67a6.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="x" /></span><script type='math/tex'>x</script>. Note that this <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_800618943025315f869e4e1f09471012.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="F" /></span><script type='math/tex'>F</script> counts unordered pairs. There are <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_a0e040bc42d9a9eb4c4bebb26e5b3490.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\frac{d(n^2)+1}{2}" /></span><script type='math/tex'>\frac{d(n^2)+1}{2}</script> unique ordered pairs with <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_387aef28346a0bfbbba3abe635b2c7df.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a \leq b" /></span><script type='math/tex'>a \leq b</script>. For <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_e0f7519ba92c55d4377262f48695ab0d.gif' style='vertical-align: middle; border: none; ' class='tex' alt="n=10^7" /></span><script type='math/tex'>n=10^7</script>, there are 225 pairs (113 ordered pairs).</p>
<p><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_4c58b61eba13591534d1edc1f23fa9b5.gif' style='vertical-align: middle; border: none; ' class='tex' alt="d(n^2)" /></span><script type='math/tex'>d(n^2)</script> can be computed naively in <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7ba55e7c64a9405a0b39a1107e90ca94.gif' style='vertical-align: middle; border: none; ' class='tex' alt="O(n)" /></span><script type='math/tex'>O(n)</script> by finding <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>'s prime factorization using trial division. Possibly there are <a href="http://en.wikipedia.org/wiki/Sieve_of_Atkin">faster algorithms</a>.</p>
<p>&nbsp;</p>
<p>Footnote: Like the divisor function, <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_800618943025315f869e4e1f09471012.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="F" /></span><script type='math/tex'>F</script> is multiplicative: if <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_595006f9765225ff6c54c170036af661.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(x,y) = 1" /></span><script type='math/tex'>(x,y) = 1</script>, <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_d48227e13c2e4ef38f5e71b73f9eff45.gif' style='vertical-align: middle; border: none; ' class='tex' alt="F(xy) = F(x)F(y)" /></span><script type='math/tex'>F(xy) = F(x)F(y)</script>. Maybe there's a way to see that directly and use it to derive a formula for <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_800618943025315f869e4e1f09471012.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="F" /></span><script type='math/tex'>F</script> in an alternate way (by first finding a formula for <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_616689e1da200035e42c847af789d4bb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="F(n)" /></span><script type='math/tex'>F(n)</script> when <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script> is a prime power.)</p>
]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=235</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Four TV Shows That Don&#039;t Suck</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=182</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=182#comments</comments>
		<pubDate>Thu, 24 Nov 2011 23:40:06 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[Defense of the New]]></category>

		<guid isPermaLink="false">http://www.evouga.com/mybrainandhischain/?p=182</guid>
		<description><![CDATA[I'm listing here four TV shows I've enjoyed in the past and highly recommend, so that I can point people here when I'm asked for procrastination material. I'm avoiding the obvious popular picks everyone has already seen (so no Firefly, Arrested Development, The Wire, Dexter, South Park, etc.) and focusing instead on shows that are [...]]]></description>
				<content:encoded><![CDATA[<p>I'm listing here four TV shows I've enjoyed in the past and highly recommend, so that I can point people here when I'm asked for procrastination material. I'm avoiding the obvious popular picks everyone has already seen (so no <em>Firefly</em>, <em>Arrested Development</em>, <em>The Wire</em>, <em>Dexter, South Park</em>, etc.) and focusing instead on shows that are older or haven't gotten as much attention.</p>
<h2>Babylon 5</h2>
<p><strong>Where to watch it:</strong> <a href="http://www.tv-links.eu/tv-shows/Babylon-5_80/season_1/episode_2/">Tvlinks</a></p>
<p><strong>Why you haven't watched it: </strong>It's a science fiction series set on a space station... that aired at the same time as <em>Deep Space Nine</em>.</p>
<p><strong>What it's about and why it's awesome: </strong>I recommend Babylon 5 to people with the same trepidation as when setting up an eccentric friend on a blind date. The show has a lot of good qualities going for it that become evident if you stick with it -- I'll come right out and say that it's the best story I've ever seen told on TV, ever -- but first impressions matter, and your first impression of Babylon 5 won't be good.</p>
<p>There's no use beating around the bush: the first season is quite terrible. The acting is bad: only about half of the main cast can act, and this half does <em>not</em> include the captain, the main character.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=182#footnote_0_182" id="identifier_0_182" class="footnote-link footnote-identifier-link" title="It does, fortunately, include the alien ambassadors Londo and G&#039;kar, who across all four seasons have by far the most intricate and compelling character arcs.">1</a></sup> There are many filler episodes with bad writing: clichÃ©d, stock science fiction plots on the one hand, and painfully clumsy, thinly-veiled allegories about contemporary issues on the other. (A child will die without a life-saving surgical procedure; the parents refuse consent for religious reasons. What should the doctor do? An interesting ethical dilemma, to be sure, and one that cannot be satisfactorily treated on an episode of a science fiction show.) And the less said about the CG, the better: slapping a low-res texture on a rotating cylinder may have been state of the art in the early nineties, but it's certainly not today.</p>
<p>If you stick with the show through its first season, though, these problems largely go away,<sup><a href="http://www.evouga.com/mybrainandhischain/?p=182#footnote_1_182" id="identifier_1_182" class="footnote-link footnote-identifier-link" title="Well, except for the CG.">2</a></sup> and your payoff is a brilliantly intricate and polished story told over three seasons with much-improved production values. The reason: J. Michael Straczynski, the show's creator, outlined all five seasons of the story (later condensed to four seasons) <em>in advance</em>, and moreover starting in season two wrote the vast majority of the episode scripts himself.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=182#footnote_2_182" id="identifier_2_182" class="footnote-link footnote-identifier-link" title="Since it&#039;s never certain whether or not a TV series will be renewed each season, almost all other shows, even the better, arc-driven ones, are written season by season. And a single person writing all of the scripts is unheard of -- usually the creator is only personally involved in the most important episodes, with other scripts rotating between members of the writing staff and guest/freelance writers. ">3</a></sup> A result of this planning is that almost all episodes of the first season, even the terrible ones, contain some background event or off-the-cuff remark that seems insignificant filler at first but sets up a payoff several seasons later. (Any time a character makes any kind of prediction or prophecy: pay attention!) The attention to detail, consistency of characterization, and ambition of the plot and themes is almost novel-like. If you value good storytelling, this show's for you.</p>
<p><strong>Notes: </strong>Danger! Watch seasons 1-4 only. JMS thought the show was going to be canceled after season 4, so squeezed all of his original story into these first four seasons. Season 5 was thus written as an afterthought (and it shows); moreover this last season introduces several new, annoying characters. Avoid. Lastly, though Babylon Five is the closest a TV show has come to being a visual novel, that novel is a meandering epic that could benefit from tightening and editing (think late Neil Stephenson.) Mediocre B-plots still show up regularly once the show has hit its stride.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=182#footnote_3_182" id="identifier_3_182" class="footnote-link footnote-identifier-link" title="JMS has some kind of obsession with plots involving old flames, for instance. None of these are good. ">4</a></sup></p>
<p>&nbsp;</p>
<h2>Great Teacher Onizuka</h2>
<p><strong>Where to watch it: </strong><a href="http://www.youtube.com/watch?v=w6MWLqO-gWs" target="_blank">Youtube</a></p>
<p><strong>Why you haven't watched it:</strong> It's an anime not called "Cowboy Bebop."<strong> </strong></p>
<p><strong>What it's about and why it's awesome: </strong>The titular Onizuka -- illiterate, perverted, and broke former leader of a bike gang -- applies for a job teaching high school, for the sole purpose of seducing high school girls. He gets assigned to a middle school class instead: a notoriously troubled one, whose students hate all teachers (for diverse reasons revealed throughout the show); he quickly discovers he has a conscience and a passion for teaching after all, and resolves to become the best teacher in Japan, solve all of his class's personal problems, and make school fun again.Â  Thanks to his stubbornness, cunning, physical indestructibility, and unwavering faith in his students, he wins the class over one by one, despite being the target of constant plots to get him fired, discredited, and/or killed by the other students as well as by faculty / the vice principle / PTA members / education critics<sup><a href="http://www.evouga.com/mybrainandhischain/?p=182#footnote_4_182" id="identifier_4_182" class="footnote-link footnote-identifier-link" title="Either these last two groups are waaaayyyy more powerful in Japan than in the United States, or there&#039;s heavy use of artistic license here...">5</a></sup> who are alarmed by his unconventional teaching methods and lack of refinement.</p>
<p>Great Teacher Onizuka is at its heart a comedy, and like Onizuka himself never takes itself too seriously. This light touch keeps the show's handling of the expected middle school themes and arcs -- bullying, broken homes, social drama -- on the right side of the line separating heartwarming from Aesoporiffic, and at its best succeeds in being truly inspiring. Any show that can wring a drop of such praise from this heart of solid jade is worth a look.</p>
<p><strong>Notes: </strong>The pacing of the show decreases significantly about halfway through, after the Urumi Kanzaki arc: it picks up again for the last few episodes, but in between is quite a bit of lower-quality (but by no means aggressively bad) filler that can be safely skipped.</p>
<p>&nbsp;</p>
<h2>Dr. Horrible's Sing Along Blog</h2>
<p><strong>Where to watch it:</strong> <a href="http://www.youtube.com/watch?v=apEZpYnN_1g">Youtube</a></p>
<p><strong>Why you haven't watched it: </strong>Dr. Horrible's... Sing Along... Blog. Three parts to the title, three good reasons to suspect the entitled work probably sucks.</p>
<p><strong>What it's about and why it's awesome: </strong>Ok, so not really a TV show -- more a three-episode musical miniseries, published direct-to-web during the writer's strike three years ago (but since it's so short, all the more reason you should go watch it, if you haven't already.)</p>
<p>Neil Patrick Harris plays the adorably incompetent wannabe villain Dr. Horrible. He aspires to (forcible) change the world by joining the Evil League of Evil and becoming a card-carrying supervillain. To do so he must prove himself to the League by successfully committing a high-profile crime; this is a rather tall order since 1) his inventions don't work, 2) he's not really evil at heart, and 3) his nemesis, hero-in-name-only Captain Hammer, always disrupts his schemes. And then Captain Hammer starts dating Dr. Horrible's crush...</p>
<p>I'm by no means a Joss Whedon fanboy: <em>Firefly</em> was brilliant, but I found <em>Buffy</em> and <em>Angel</em> thoroughly mediocre, and will invoke the Golden Rule and say nothing at all regarding <em>Dollhouse</em>. This musical, though, is Joss at his best: campy and quirky, funny and clever, but with a serious theme underlying it all. The writing is crisp and tight and the pace frenetic -- blink and you'll miss a joke, in a way reminiscent of <em>Arrested Development</em>. The story -- well, I'm a total sucker for this type of story.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=182#footnote_5_182" id="identifier_5_182" class="footnote-link footnote-identifier-link" title="People usually can&#039;t articulate what they really want, and those who do are usually dead wrong. Incidentally, &quot;what do you want?&quot; plays a central role in Babylon 5...">6</a></sup> I can't say much without spoiling the ending, but pay close attention to how Dr. Horrible transforms over the course of the show; it's artfully done.</p>
<h2></h2>
<h2>Veronica Mars</h2>
<p><strong>Where to watch it: </strong><a href="http://www.tv-links.eu/tv-shows/Veronica-Mars_704/">Tvlinks</a><strong><br />
</strong></p>
<p><strong>Why you haven't watched it:</strong> Yet another teen high school show.</p>
<p><strong>What it's about and why it's awesome:</strong> Veronica, teenage daughter of a private investigator, helps her dad solve her best friend's murder. That's the season-long framing story; each episode focuses on Veronica solving a more self-contained mystery (who rigged the school elections, who stole the money at a poker game, why did a student join a cult -- that kind of thing) while slowly advancing the main plot. Think Nancy Drew but snarky, cynical, and played by Kirsten Bell.</p>
<p>The show is notable for pulling no punches with the mature themes it explores, and for its morally ambiguous view of the main characters and the world. The first episode alone includes teenage drinking and sex, class warfare, racism, date rape, and of course murder; and it doesn't get much lighter from there. Very few of the characters are portrayed in a purely sympathetic light -- Veronica's dad and her sidekick Wallace are the two that come closest -- nor does the show have many true villains. Veronica herself (setting aside the ethical flexibility that comes with the job of being a PI) doesn't hesitate to exact elaborate revenge on those who embarrass or slight her. The random students she agrees to help are invariable somehow responsible for the trouble they're in, or have their own agenda. Logan, jerkass (and hilarious) entitled rich kid and Veronica's main enemy at school, is shown to have a dysfunctional, abusive family and occasionally has his moments of heroism. And so on.</p>
<p>The mystery itself is quite well-constructed; the clues come slowly enough and have enough red herrings to invite mass viewer speculation, and by the end of the season the whole web holds together consistently, the killer is plausible but by no means obvious (always a difficult balance on a TV show, since the killer must be someone the audience has been introduced to over the course of the show, but draw too much attention to a random minor character and you give up the game...) The individual episode plots are more variable,Â  but even the lamer ones are worth watching for Veronica and Logan's snarky asides alone.</p>
<p><strong>Notes: </strong>Danger! Watch the first season only. Individual second season episodes have their moments, but the season-long overarching mystery doesn't hang together nearly as well. I haven't watched the third season myself, but I have it on good authority that it's terrible.</p>
<h2></h2>
<h2>Bonus section: Three shows everyone loves that actually suck</h2>
<p><strong>The Office:</strong> Dealing with these kinds of people in the real world is draining enough... I don't want to watch more of them on TV.</p>
<p><strong>24:</strong> I don't have time to explain.</p>
<p><strong>Lost:</strong> The anti-Babylon 5; an intellectual Ponzi scheme. It's not at all hard to write a mystery with a veneer of complexity and intricacy, after all: just keep making stuff up as you go along, with no clear idea of how the plot will eventually tie together consistently and resolve.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=182#footnote_6_182" id="identifier_6_182" class="footnote-link footnote-identifier-link" title="X-Files was an even more egregious example of this kind of writing, but doesn&#039;t have Lost&#039;s popularity.">7</a></sup></p>
<p>&nbsp;</p>
<ol class="footnotes"><li id="footnote_0_182" class="footnote">It does, fortunately, include the alien ambassadors Londo and G'kar, who across all four seasons have by far the most intricate and compelling character arcs.</li><li id="footnote_1_182" class="footnote">Well, except for the CG.</li><li id="footnote_2_182" class="footnote">Since it's never certain whether or not a TV series will be renewed each season, almost all other shows, even the better, arc-driven ones, are written season by season. And a single person writing all of the scripts is unheard of -- usually the creator is only personally involved in the most important episodes, with other scripts rotating between members of the writing staff and guest/freelance writers. </li><li id="footnote_3_182" class="footnote">JMS has some kind of obsession with plots involving old flames, for instance. None of these are good. </li><li id="footnote_4_182" class="footnote">Either these last two groups are waaaayyyy more powerful in Japan than in the United States, or there's heavy use of artistic license here...</li><li id="footnote_5_182" class="footnote">People usually can't articulate what they really want, and those who do are usually dead wrong. Incidentally, "what do you want?" plays a central role in <em>Babylon 5</em>...</li><li id="footnote_6_182" class="footnote"><em>X-Files</em> was an even more egregious example of this kind of writing, but doesn't have <em>Lost</em>'s popularity.</li></ol>]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=182</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Vouga of Arabia</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=175</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=175#comments</comments>
		<pubDate>Sat, 12 Nov 2011 21:29:20 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[Breathtaking True Stories from the Continuing Adventures of Etienne Vouga, PhD Student]]></category>

		<guid isPermaLink="false">http://www.evouga.shardstorm.com/mybrainandhischain/?p=175</guid>
		<description><![CDATA[Last week was Eid al Adha (a.k.a. "Hajj break"), which for me meant only that there were less students around campus, and a lot of the facilities were shut down. I did get the opportunity, though, to take the bus into downtown Jeddah and do some shopping and sightseeing. There are really only two places [...]]]></description>
				<content:encoded><![CDATA[<p>Last week was Eid al Adha (a.k.a. "Hajj break"), which for me meant only that there were less students around campus, and a lot of the facilities were shut down. I did get the opportunity, though, to take the bus into downtown Jeddah and do some shopping and sightseeing.</p>
<p>There are really only two places you can go outside of campus. The first is Thuwal, a fishing village right outside and visible from KAUST. The dining hall on campus is a typical cafeteria, serving generic international food;<sup><a href="http://www.evouga.com/mybrainandhischain/?p=175#footnote_0_175" id="identifier_0_175" class="footnote-link footnote-identifier-link" title="the one exception, of course, is the lack of pork: &quot;bacon&quot; here always means small bits of beef.">1</a></sup> restaurants in Thuwal offer quite a different experience. To begin with, the dining area is segregated into different section, neither visible to the other: one for men, and the other for families. (In practice, a family is any group of people containing at least one woman; even groups of obviously different races don't raise any eyebrows. At least around here -- I've heard that in the more conservative regions of the country, near Riyadh, "family" might be interpreted more literally.) Secondly, the customary way of eating is on the floor, on a carpet, with no utensils. Over the past few years, though, the amount of business coming in from KAUST has encouraged restaurants to slowly invest in western concessions: they have a few tables and chairs they keep in the back, and a few sets of silverware, that they bring out as needed. Thirdly, at a seafood restaurant I visited a few weeks ago, the main course wasn't ordered off of the menu: instead, you first visit a fish market in a building next door, and pick out the fresh fish you would like to eat. Only after you've selected your dinner, haggled a bit over price, and informed the staff how you'd like the fish cooked, do you get seated and order drinks and sides off of a menu.</p>
<p>The second possible destination is Jeddah, the largest city in the area (population ~3 million) and about 45 minutes away from KAUST.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=175#footnote_1_175" id="identifier_1_175" class="footnote-link footnote-identifier-link" title="Mecca and Medina are also nearby, but strictly forbidden to non-Muslisms.">2</a></sup> A bus travels there and back once a day, which is lucky because I wouldn't want to drive even if I owned a car: lanes are strictly suggestions (and the shoulder of the road counts as a lane), driving over sidewalks and medians is the accepted way of taking shortcuts and U-turns, feral donkeys and camels wander onto the street, etc etc. Only in Boston have I seen crazier drivers (where, in addition to the ubiquitous double-parking, I've witnessed one clever guy's solution to one-way streets: drive at full speed in reverse.)</p>
<p>The bus makes three stops in Jeddah: the Mall of Arabia, Red Sea Mall, and downtown. I've never been to the first two (and I'm not particularly interested in doing so.) I was warned by a coworker: if you visit downtown Jeddah by yourself, take a map and a compass, and give yourself two hours to find your way back to the bus. I completely ignored him, of course, and got horribly lost. Jeddah's downtown is a vast labyrinth of twisty streets and alleys, with a scattering of larger shopping centers and hundreds of smaller stores selling incense, carpets, clothing (including abayas; I promised to pick one up for a friend), bars of gold, more different kinds of dates than I ever imagined existed, etc. The shopkeepers are all terrificly friendly. Haggling over everything is a little off-putting at first, but eventually you realize that you're arguing over what amounts to less than a buck or two.</p>
<p>The mosques at KAUST announce the five daily prayers, but unless you are unlucky enough to live directly under the minarets of the campus Grand Mosque the prayer times have no significant effect on daily life. Not so at all in Jeddah. When a prayer time begins, all customers are kicked out of stores and the stores close, for a not insubstantial amount of time. According to coworkers, one trick is to order take-out right before the prayer begins, and eat while waiting for it to end; of course, this strategy still requires knowing <em>when</em> the next prayer will begin, which changes daily. Another unique aspect of shopping in Jeddah is that stores tend to be clumped into groups offering identical wares: one block will be entirely devoted to carpets, the next to paint, etc. At first this arrangement didn't make any business sense to me: if you're opening a carpet store, why place yourself right next to your competitors? But it was explained to me that this system has established itself as a Nash equilibrium of sorts: customers looking for a carpet know to look (only) on the carpet store block, and a carpet vendor trying to set up shop elsewhere would only starve himself of customers.</p>
<ol class="footnotes"><li id="footnote_0_175" class="footnote">the one exception, of course, is the lack of pork: "bacon" here always means small bits of beef.</li><li id="footnote_1_175" class="footnote">Mecca and Medina are also nearby, but strictly forbidden to non-Muslisms.</li></ol>]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=175</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>The Most Irrational Number</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=150</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=150#comments</comments>
		<pubDate>Wed, 09 Nov 2011 23:35:39 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[Random Math]]></category>

		<guid isPermaLink="false">http://www.evouga.shardstorm.com/mybrainandhischain/?p=150</guid>
		<description><![CDATA[What is the most irrational number? In a sense this is an ill-posed question: we can surely agree that a rational number cannot qualify as "most irrational," but beyond that we could well have very different ideas of what "more irrational" means. Is more irrational than ? Is a transcendental number like more irrational than [...]]]></description>
				<content:encoded><![CDATA[<p>What is the most irrational number? In a sense this is an ill-posed question: we can surely agree that a rational number cannot qualify as "most irrational," but beyond that we could well have very different ideas of what "more irrational" means. Is <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9a132a1fa0d4f51451f00801ccbfe963.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\sqrt[3]{2}" /></span><script type='math/tex'>\sqrt[3]{2}</script> more irrational than <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_d21848cdd835abcb491be1f151e9b6c6.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\sqrt{2}" /></span><script type='math/tex'>\sqrt{2}</script>? Is a transcendental number like <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_4f08e3dba63dc6d40b22952c7a9dac6d.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="\pi" /></span><script type='math/tex'>\pi</script> more irrational than an algebraic number like <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_d21848cdd835abcb491be1f151e9b6c6.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\sqrt{2}" /></span><script type='math/tex'>\sqrt{2}</script>?</p>
<p>One possible approach is to call a number more irrational if it is harder to approximate using a rational number. We can visualize geometrically how easy it is to approximate a given irrational number <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>: take the plane, and place a dot at every point <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_90cbc22edf225adf8a68974f51227f05.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(x,y)" /></span><script type='math/tex'>(x,y)</script> with integer coordinates, such as <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_5c16f757233856dcf311176b7410d2d5.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(0,0)" /></span><script type='math/tex'>(0,0)</script>, <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_ec6014ffc3d92709aa6a4fea11bb3788.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(1,0)" /></span><script type='math/tex'>(1,0)</script>, <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8666756b9458fe068d3d3769b68bcdef.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(3,4)" /></span><script type='math/tex'>(3,4)</script>, <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_bf07e6c3365e176e5c1b460c62d53683.gif' style='vertical-align: middle; border: none; ' class='tex' alt="(-8, 10)" /></span><script type='math/tex'>(-8, 10)</script> and so on. Such points are called <em>lattice points</em>. Placing a dot at every lattice point gives you a square grid of points (like if you take graph paper and draw a dot everywhere a horizontal and vertical line meet).</p>
<p>Now start at the origin, and draw a line of slope <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>. Since <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script> is irrational this line will never hit a lattice point (otherwise the slope of the line, and hence <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>, would be rational). But the longer you make the line, the more near misses there will be where the line passes right by a lattice point. A line that very quickly comes very close to hitting a lattice point can be better approximated by a rational number than one that avoids coming near a lattice point for as long as possible.</p>
<p>We can construct concrete rational approximations of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>: the simplest thing we can do, for instance, is simply take the floor: <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_80520c613811395e5f2100555380e4d1.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\lfloor \xi \rfloor" /></span><script type='math/tex'>\lfloor \xi \rfloor</script>. This splits <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script> up into an integer part and a fractional part:</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_f57ee82890fd867242bf395a1ae5aa4d.gif' style='vertical-align: middle; border: none;' class='tex' alt="\xi = \lfloor \xi \rfloor + (\xi-\lfloor \xi \rfloor) = a_1 + r_1," /></span><script type='math/tex;  mode=display'>\xi = \lfloor \xi \rfloor + (\xi-\lfloor \xi \rfloor) = a_1 + r_1,</script></p></p>
<p>where <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_027c3429f98f7c39bab027549e1b9c7b.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="a_1" /></span><script type='math/tex'>a_1</script> is an integer and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_dae685efb37cc6ba8efde253015302e1.gif' style='vertical-align: middle; border: none; ' class='tex' alt="0 < r_1 < 1." /></span><script type='math/tex'>0 < r_1 < 1.</script> <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_027c3429f98f7c39bab027549e1b9c7b.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="a_1" /></span><script type='math/tex'>a_1</script> is a rational approximation of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script> (although quite a bad one.) <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9e0e6bcaceaf9b474f1182d21813012b.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\frac{1}{r_1}" /></span><script type='math/tex'>\frac{1}{r_1}</script> is a number greater than 1, so we can improve on this naive approximation by writing</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_2181bbeacc5b316a05da6036f4993a42.gif' style='vertical-align: middle; border: none;' class='tex' alt="\xi = a_1 + r_1 = a_1 + \frac{1}{\frac{1}{r_1}} = a_1 + \frac{1}{\lfloor \frac{1}{r_1} \rfloor + \left(\frac{1}{r_1} - \lfloor \frac{1}{r_1} \rfloor\right)} = a_1 + \frac{1}{a_2 + r_2}," /></span><script type='math/tex;  mode=display'>\xi = a_1 + r_1 = a_1 + \frac{1}{\frac{1}{r_1}} = a_1 + \frac{1}{\lfloor \frac{1}{r_1} \rfloor + \left(\frac{1}{r_1} - \lfloor \frac{1}{r_1} \rfloor\right)} = a_1 + \frac{1}{a_2 + r_2},</script></p></p>
<p>where <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_30c872662b356aa720d1971361b45724.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="a_2" /></span><script type='math/tex'>a_2</script> is a positive integer and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9968fc4470c99482a3c991158a8e9448.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="r_2" /></span><script type='math/tex'>r_2</script> again satisfies <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_ebfa547b6e59d7d5191e74235b454e92.gif' style='vertical-align: middle; border: none; ' class='tex' alt="0 < r_2 < 1." /></span><script type='math/tex'>0 < r_2 < 1.</script> Forgetting about the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9968fc4470c99482a3c991158a8e9448.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="r_2" /></span><script type='math/tex'>r_2</script> gives a new rational approximation <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_34b92aca3d382480ec0d9f35320b84d9.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a_1 + \frac{1}{a_2}." /></span><script type='math/tex'>a_1 + \frac{1}{a_2}.</script></p>
<p>Now we can again write <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9968fc4470c99482a3c991158a8e9448.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="r_2" /></span><script type='math/tex'>r_2</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_74a90ac6057272a450aced221148b219.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\frac{1}{a_3 + r_3}" /></span><script type='math/tex'>\frac{1}{a_3 + r_3}</script>, and then do the same thing with <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_c3724de2c7d50b65bd5eb3d21f8c2fcf.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="r_3" /></span><script type='math/tex'>r_3</script>, and so on over and over again until we have an infinite <em>continued fraction</em></p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_926f34a0a4d81cd2b46531312e494cab.gif' style='vertical-align: middle; border: none;' class='tex' alt="\xi = a_1 + \cfrac{1}{a_2 + \cfrac{1}{a_3 + \cfrac{1}{a_4 + \cfrac{1}{\ddots}}}}." /></span><script type='math/tex;  mode=display'>\xi = a_1 + \cfrac{1}{a_2 + \cfrac{1}{a_3 + \cfrac{1}{a_4 + \cfrac{1}{\ddots}}}}.</script></p></p>
<p>Truncating this continued fraction after <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_825b3fd5bafbc46b9a560ea9f16b21dd.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="a_n" /></span><script type='math/tex'>a_n</script> gives a rational number called the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>-th <em>convergent</em> of the continued fraction. These convergents are increasingly better approximations of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>. For example, here are the first few convergents when <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_edf21d9c0de5836881f9df2d349787af.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi = \pi" /></span><script type='math/tex'>\xi = \pi</script>:</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_cf7f3eb9faf166e4b46aa83b0a702b01.gif' style='vertical-align: middle; border: none;' class='tex' alt="\begin{align*}3 &= 3\\3+\frac{1}{7} &= \frac{22}{7} \approx 3.143\\3+\cfrac{1}{7+\cfrac{1}{15}} &= \frac{333}{106} \approx 3.14151\\3+\cfrac{1}{7+\cfrac{1}{15+\cfrac{1}{1}}} &= \frac{355}{113} \approx 3.1415929\\3+\cfrac{1}{7+\cfrac{1}{15+\cfrac{1}{1+\cfrac{1}{292}}}} &= \frac{103993}{33102} \approx 3.1415926530.\end{align*}" /></span><script type='math/tex;  mode=display'>\begin{align*}3 &= 3\\3+\frac{1}{7} &= \frac{22}{7} \approx 3.143\\3+\cfrac{1}{7+\cfrac{1}{15}} &= \frac{333}{106} \approx 3.14151\\3+\cfrac{1}{7+\cfrac{1}{15+\cfrac{1}{1}}} &= \frac{355}{113} \approx 3.1415929\\3+\cfrac{1}{7+\cfrac{1}{15+\cfrac{1}{1+\cfrac{1}{292}}}} &= \frac{103993}{33102} \approx 3.1415926530.\end{align*}</script></p></p>
<p>Some of these convergents should look familiar. In fact, the convergents of the continued fraction of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script> satisfy several remarkable properties:</p>
<ul>
<li>The convergents are the best possible rational approximations of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>, in the sense that any other fraction with denominator less than or equal to that of the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>-th convergent is a worse approximation of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>.</li>
<li>The convergents alternate between overestimating and underestimating <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>, with <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script> sandwiched between them.</li>
<li>Two successive convergents <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_c9f6673dcbf6b04907dec0e7a28a3fad.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\frac{n_i}{d_i}" /></span><script type='math/tex'>\frac{n_i}{d_i}</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_45f92c4cdf419a12b13854c003652701.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\frac{n_{i+1}}{d_{i+1}}" /></span><script type='math/tex'>\frac{n_{i+1}}{d_{i+1}}</script> bound <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script> to within <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_654e4cc728bdad3cd20c73f97d8b5673.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\frac{1}{d_i d_{i+1}}" /></span><script type='math/tex'>\frac{1}{d_i d_{i+1}}</script>.</li>
<li>The a particular <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_2aecb1dc57e87620a373d19b0a889efb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a_i" /></span><script type='math/tex'>a_i</script> in the continued fraction is large, the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_800ba394e806c049c98cf4b570d04c72.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="i-1" /></span><script type='math/tex'>i-1</script>-st convergent is a particularly good approximation of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>. (This makes sense, since <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_2aecb1dc57e87620a373d19b0a889efb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a_i" /></span><script type='math/tex'>a_i</script> large implies <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_bb5640e1665b1052c15fa57c6cccaf48.gif' style='vertical-align: middle; border: none; ' class='tex' alt="r_{i-1}" /></span><script type='math/tex'>r_{i-1}</script> small. This fact explains why <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_e8492270701923b557068f5a5a63e493.gif' style='vertical-align: middle; border: none; ' class='tex' alt="355/113" /></span><script type='math/tex'>355/113</script> is such an accurate approximation of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_4f08e3dba63dc6d40b22952c7a9dac6d.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="\pi" /></span><script type='math/tex'>\pi</script> for its denominator: the next value of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_0cc175b9c0f1b6a831c399e269772661.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="a" /></span><script type='math/tex'>a</script> is quite large (292).</li>
<li>The larger the values of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_2aecb1dc57e87620a373d19b0a889efb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a_i" /></span><script type='math/tex'>a_i</script> on average, the faster the convergents converge to <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_195246810f9bfc228bca491859062b14.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi" /></span><script type='math/tex'>\xi</script>.</li>
</ul>
<p>The first and last properties give us a tool for answering our original question: the irrational number that can be least well approximated by rational numbers is the one whose convergents converge most slowly, i.e., the one whose <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_2aecb1dc57e87620a373d19b0a889efb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a_i" /></span><script type='math/tex'>a_i</script> in its continued fraction are the smallest. <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_2aecb1dc57e87620a373d19b0a889efb.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a_i" /></span><script type='math/tex'>a_i</script> must be positive (except for the integer part <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_027c3429f98f7c39bab027549e1b9c7b.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="a_1" /></span><script type='math/tex'>a_1</script>; we'll arbitrary set <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_6d32420df194fb45a65c40ee7c438751.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a_1=1" /></span><script type='math/tex'>a_1=1</script>), so the most irrational number <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9dd4e461268c8034f5c8564e155c67a6.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="x" /></span><script type='math/tex'>x</script> has continued fraction</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_423eb47be69fe07a7b25c27fb10f70ab.gif' style='vertical-align: middle; border: none;' class='tex' alt="x = 1 + \cfrac{1}{1+\cfrac{1}{1+\cfrac{1}{1+\cfrac{1}{1+\ddots}}}}." /></span><script type='math/tex;  mode=display'>x = 1 + \cfrac{1}{1+\cfrac{1}{1+\cfrac{1}{1+\cfrac{1}{1+\ddots}}}}.</script></p></p>
<p>We can even solve for <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9dd4e461268c8034f5c8564e155c67a6.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="x" /></span><script type='math/tex'>x</script>, using the "fractal expression trick." If the continued fraction above converges (which is plausible, and not hard to show) it must converge to a fixed point of the map</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_3bf16800839717f6291bec19faba3a73.gif' style='vertical-align: middle; border: none;' class='tex' alt="x = 1+\frac{1}{x}." /></span><script type='math/tex;  mode=display'>x = 1+\frac{1}{x}.</script></p></p>
<p>Solving for <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_9dd4e461268c8034f5c8564e155c67a6.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="x" /></span><script type='math/tex'>x</script> gives the quadratic equation <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_47f5785ebd7a81c9c573453b30459a7e.gif' style='vertical-align: middle; border: none; ' class='tex' alt="x^2 - x - 1=0" /></span><script type='math/tex'>x^2 - x - 1=0</script>, whose only positive root is <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_263546e6e75c4be45bd3c04362d412d0.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\frac{1 + \sqrt{5}}{2}" /></span><script type='math/tex'>\frac{1 + \sqrt{5}}{2}</script> -- the golden ratio <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_1ed346930917426bc46d41e22cc525ec.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\phi" /></span><script type='math/tex'>\phi</script>!</p>
<p>&nbsp;</p>
<p>So in this sense <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_1ed346930917426bc46d41e22cc525ec.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\phi" /></span><script type='math/tex'>\phi</script> is the most irrational number. If two notes have frequencies in the ratio of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_1ed346930917426bc46d41e22cc525ec.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\phi" /></span><script type='math/tex'>\phi</script>, does this fact imply that their interval is the most dissonant possible?<sup><a href="http://www.evouga.com/mybrainandhischain/?p=150#footnote_0_150" id="identifier_0_150" class="footnote-link footnote-identifier-link" title="The tritone sounds dissonant on stringed instruments like the piano or guitar because the overtones interfere. Flutes and tuning forks are much better at damping high frequencies, so notes played on these tend to be much purer: if you form a tritone by playing two flutes or ringing two tuning forks the interval sounds quite consonant.">1</a></sup>Â  While in NYC I tried to find tuning forks I could modify to test this hypothesis -- but it doesn't seem like any music stores (at least none of the ones in Manhattan) sell them anymore. (I was surprised to discover that there's still quite a large market of them online, however -- many sites sell (grossly overpriced) tuning forks for use in some kind of "sound healing" quackery.)</p>
<ol class="footnotes"><li id="footnote_0_150" class="footnote">The tritone sounds dissonant on stringed instruments like the piano or guitar because the overtones interfere. Flutes and tuning forks are much better at damping high frequencies, so notes played on these tend to be much purer: if you form a tritone by playing two flutes or ringing two tuning forks the interval sounds quite consonant.</li></ol>]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=150</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Lessons Learned Volunteering on an Internet Project</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=132</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=132#comments</comments>
		<pubDate>Thu, 03 Nov 2011 22:47:32 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[Breathtaking True Stories from the Continuing Adventures of Etienne Vouga, PhD Student]]></category>

		<guid isPermaLink="false">http://www.evouga.shardstorm.com/mybrainandhischain/?p=132</guid>
		<description><![CDATA[Zelda Classic started out, in the dark forgotten days of DOS, as a clone of the very first Nintendo Zelda game, painstakingly reverse-engineered by a pair of high school students in Ohio. What set it apart from the numerous other ROMs and pirated copies of the game on the Internet was the "quest editor" bundled [...]]]></description>
				<content:encoded><![CDATA[<p><a href="http://www.zeldaclassic.com">Zelda Classic</a> started out, in the dark forgotten days of DOS, as a clone of the very first Nintendo Zelda game, painstakingly reverse-engineered by a pair of high school students in Ohio. What set it apart from the numerous other ROMs and pirated copies of the game on the Internet was the "quest editor" bundled with it: using this simple graphical editor, fans of the game with no particular experience programming could quickly and easily create their very own game, with completely new levels and graphics, but the same Zelda look and feel.</p>
<p>Over time the game grew in popularity and functionality: the original creators moved on to other projects, but new programmers picked up where they left off and ported it to Windows, modernized some of the user interface, and added many, many new features to the quest editor. It became possible to create games with polish rivaling the official Zelda games on the Super Nintendo and Gameboy.</p>
<p>Zelda Classic was at its apogee around the time I first became involved with the project's development seven years ago; it had been featured on TechTV's show The Screen Savers, and in EGM magazine, and as a result more users than ever were playing the old fan-made "quests" and creating new ones. Zelda Classic was downloaded over a million times, and several hundred fan-made quests were submitted and "published" on the official site.</p>
<p>But whereas the fan community was thriving, development had stagnated. The last stable release was years old; newer betas had occasionally been publicly released, but these betas were notoriously buggy and widely avoided. Under the theory that fresh blood would hurry things along,<sup><a href="http://www.evouga.com/mybrainandhischain/?p=132#footnote_0_132" id="identifier_0_132" class="footnote-link footnote-identifier-link" title="This is a classic blunder, almost as well-known as &quot;never get involved in a land war in Asia&quot; and &quot;never go against a Sicilian when death is on the line.&quot;">1</a></sup> a call went out for new developers. Devoting time to a project one good cease-and-desist letter away from being permanently shut down wasn't going to make me rich or famous, but it looked like a fun way to hone my coding skills. I signed on.</p>
<p>I wasn't Zelda Classic's original programmer, nor was I ever the lead programmer during the time I actively contributed to development. But I left a significant mark on the project and am proud my accomplishments: the C-like scripting language I added to the quest editor is one of its most ambitious and complex features; I led the team in number of bugs fixed; and I became webmaster of the code repository, official project site, and associated community forums.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=132#footnote_1_132" id="identifier_1_132" class="footnote-link footnote-identifier-link" title="A role I still hold, more by default than any abundance of spare time, or love of web work.">2</a></sup> Most importantly, I experienced first-hand the challenges of working on and leading a large, popular, volunteer software project. Below are the three most important lessons I learned during this experience.</p>
<h3>Â 1. The allure of Cool Things is irresistible.</h3>
<p>When a programmers volunteers to work on a project, she does so because she is full of ideas about Cool Things that <em>need</em> to be added to the project, as soon as possible. This feeling is completely understandable: everyone who's used a tool for long enough accumulates a long list of ways the tool could be improved. Fixing bugs is boring, time-consuming, and thankless. Adding a new feature, on the other hand -- especially a Cool, flashy, long-requested one -- is fun, brings glory, and satisfies the basic human need to press hands into new sidewalks, to leave a mark that you can later point to and say, "I was there, I contributed to that!" If the new feature doesn't quite work right at first, or doesn't play well with the Cool Things that others added yesterday, well, there's plenty of time to fix that tomorrow, when/if the natives complain enough.</p>
<p>The problem only gets worse as times goes on, due to combinatorial explosion. In the original Legend of Zelda, for instance, there are bodies of water blocking the player's path, that can only be crossed in one of two ways: by using a stepladder, or riding a raft. Code is needed to make sure nothing breaks if the player tries to use the ladder while already riding the raft, and vice versa. Easy.</p>
<p>Now we add a new way to cross water: flippers that give you the ability to swim. There are four ways adding flippers might break the code: what happens if the player tries to use the raft or ladder while already swimming through the water? What if he tries to dive off of raft or ladder while wearing flippers? All of these possibilities must be taken into account.</p>
<p>Now we add a new item that lets the player jump short distances. The player can use this item to jump across narrow streams. He can also jump into lakes -- if he has the flippers, he'll dive in and start to swim; otherwise, he'll drown. Can the player jump into or across water if he's already standing on the ladder or raft? We have to write code to deal with that. What if the player tries to use the ladder or raft while in midair over water? Clearly that shouldn't be allowed. And wait -- what if he tries to jump while already in the water, swimming with the flippers?</p>
<p>Every new feature added exponentially increases the number of possible interactions, and thus the number of bugs, since some of these interactions are inevitably missed. Debugging starts to feel like a Sisyphean task, as the system becomes complex enough that a "fix" for one bug introduces a new bug somewhere else.</p>
<p>We tried several strategies to keep testing and debugging manageable: we recruited as many users as we could to perform beta testing; we decreased the time between releases of betas, to tighten the testing and feedback loop; we urged voluntary "feature freezes" where only changes to the code that fixed bugs, and added no new features, were allowed. These measures helped, but weren't enough: without managers or deadlines we simply didn't have the self-discipline to 1) carefully consider the long-term consequences of the changes we introduced; 2) adequately test our changes; or 3) force ourselves to slow down and ship something stable before moving on to the next Cool Thing.</p>
<p>There are several measures open-source projects have taken to solve this problem: mandatory review of every change by a second developer; more central leadership with one person ultimately responsible for deciding which features to include and reject; separate branches for experimental new features still being worked on, and for well-tested new features that will definitely be included in the next release; etc. I woudn't start any new project with as large a scope as Zelda Classic without thinking very seriously about how to reign in feature creep, keep developers on target, and ensure development sticks to a coherent long-term plan.</p>
<h3>2. The user community is your most valuable resource.</h3>
<p>I've been very impressed by the quality of the custom quests created by users with Zelda Classic -- as I mentioned before, many of these are larger, more polished, and more fun than even the official Nintendo games, and I can't imagine how many hours of time must have gone into crafting them. Equally impressive, though, was the amount of effort the community was willing to contribute to the project.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=132#footnote_2_132" id="identifier_2_132" class="footnote-link footnote-identifier-link" title="Perhaps I shouldn&#039;t be too surprised, since I too was &quot;the community&quot; before signing on as a programmer...">3</a></sup> Us programmers had barely enough time and resources to do the programming... from beta testing, to marketing, to helping new users work the program, to designing and maintaining the web site, many tasks crucial to the smooth running of the project were handled by fans of Zelda Classic who volunteered their talents, unsolicited.</p>
<p>The corollary is that the user community is an Internet project's most valuable resource. The most ominous sign I see for the future of Zelda Classic is that this community has slowly dwindled over the last few years. The lack of a recent new version of the program is partly to blame, but there were several other preventable factors at play. Firstly, the official forums were repeatedly hacked and infected with malware, leading many users to abandon the forums and the project altogether. Secondly, as Zelda Classic grew in popularity, the community divided into two camps: friends of the original programmers, early adopters, and other users who had been around from the very beginning; and "newbies" who had only recently heard of Zelda Classic and decided to check it out. The former became vested contributors -- people who, by virtue of their having been around the longest, and having contributed most to the project, felt they were entitled to greater privileges, and fewer rules, than the new arrivals. The former resented the later for being on average younger and less mature, and asking many basic questions; the latter resented the former for being arrogant, rude, and cliquish. This friction grew until the community split, with most of the newer users migrating to their own, more welcoming community. The code itself didn't fork -- it couldn't, being closed-source -- but the code was hardly the project's most precious resource -- the users were.</p>
<p>Incidentally, vested contributors are a significant problem facing many collaborative efforts on the Internet -- Wikipedia and Stackoverflow and two such projects that spring to mind. For both of these projects I predict overindulgence of vested contributors as the most likely point of failure.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=132#footnote_3_132" id="identifier_3_132" class="footnote-link footnote-identifier-link" title="Though Wikipedia has quite a few other problems.">4</a></sup></p>
<h3>3. You can't take back moves.</h3>
<p>As you release new versions of software, there are two approaches you can take to deal with user data (in the case of Zelda Classic, user-made "quests") created with old versions of the program:</p>
<ul>
<li>The Apple approach: You don't worry about backwards-compatibility. Each version of your software makes a clean break from previous ones. This is the case for different version of Apple's operating system: if you're lucky, the program you wrote for one big cat continues to work on the next one, but there's no guarantee it will do so. This approach is great for the programmers of Mac OS, as it gives them the freedom to start completely from scratch, learn from their mistakes, and redesign or ditch completely those features of the operating system that didn't work as well in practice as they'd hoped. It's not so great for the application programmers: the burden of making sure the application continues to work over time has been passed down to them.</li>
<li>The Microsoft approach: You try to keep your software as backwards-compatible as possible. Programs written for Windows XP or Vista (and, for sufficiently popular programs, even Windows 95 or DOS) continue to work on Windows 7. This situation is ideal for application developers: they write a program once, and Microsoft, not them, has to worry about it continuing to work in the future. It's also great for users of the program, since the program continues to work even if its developers go out of business, get hit by a bus, etc. But maintaining backwards-compatibility forces Microsoft to be very conservative about what it changes from version of Windows to another, and forces Microsoft to bloat its software with components that serve no purpose but tricking old programs into thinking they're still running on e.g. Windows XP, so that they continue to work correctly.</li>
</ul>
<p>Zelda Classic chose the Microsoft approach long before I joined the project. It's the approach that's friendliest to end-users, and so is a natural choice for a free program entirely reliant on its user community for survival. But it's a choice that has cost us dearly in terms of program complexity.</p>
<p>Suppose you're using Zelda Classic to make your own quest, and you decide you want to make the player lose his sword midway through the game (he gets robbed by bandits, say.) You look through Zelda Classic's features, but see no way of taking away an item that you've already given to the player. You ask on the Internet if anyone has any suggestions -- and another user tells you that, although there is no official way of taking away the sword, there's a bug in the current version of Zelda Classic where if you try to give the player a second sword while he's holding his sword, a shield, and is facing left, the player loses both swords instead. "Perfect!," you think. You've found a creative way of working around the constraints imposed on you, and you can put that bandit scene into your game after all.</p>
<p>Years later, someone reports that giving players a second sword isn't working correctly in some cases. We investigate, find the bug, and fix it -- but now all kinds of old quests aren't working anymore; bandits are robbing players but the sword doesn't disappear. And we promised old quests would continue to work flawlessly in the future! "Oh come on," we might grumble. "What were you thinking?!? You're obviously exploiting undocumented, buggy behavior. How could you possibly think it's a good idea to rely on this bug?" But there's no telling how many other people also discovered and exploited the bug, and we don't want all of their quests to stop working, so we grit our teeth and modify our code: if a quest was created before a certain date, use the buggy sword addition code. Otherwise, use the new, correct sword addition code.</p>
<p>This situation happens all of the time: a sufficiently large group of users is infinitely ingenious and no more immune to the danger of Cool Things than the developers. If features can be combined in unintended ways to create a neat effect, they will find the combination and use it. They will find undocumented features used for internal testing. They will find bugs and exploit them.Â  And you will only find out after you make a seemingly-innocent change to the code and discover it breaks a bunch of old quests.</p>
<p>Another consequence of backward-compatibility is that every new feature you add becomes an indefinite commitment. If the feature is poorly thought out, it will hamstring you. Over time Zelda Classic has accumulated many such missteps -- options and settings that almost nobody ever uses, but that interact in complicated ways with the rest of the program, and are endless sources of bugs. For more experimental features, we tried telling users, "this new feature is strictly beta. We might take it out at any time; please don't create quests that rely on it." We even incorporated a popup window with that same message into the program itself. Users would rely on the feature anyway, with the best intentions: at first they just wanted to play around with it and test it. But as they invested more and more time into works in progress depending on the feature, they became increasingly reluctant to give it up.</p>
<p>Striking a balance between backwards-compatibility and freedom to revisit past mistakes is a challenge even Microsoft is struggling to solve, and there are no easy answers. But there are several things Zelda Classic could have done differently to partially tame the problem. Most importantly, and relating back to the first lesson, we could have been more conservative about which features we expose to the public. We could also have compromised a bit on backwards compatibility; if I were to start over from scratch, I would wrap Zelda Classic in a meta-program that detected what version a quest was created with, and downloaded that version of the quest player if needed, instead of trying to make the most recent version of the quest player compatible with all old quests.</p>
<p>&nbsp;</p>
<ol class="footnotes"><li id="footnote_0_132" class="footnote">This is a <a href="http://www.amazon.com/Mythical-Man-Month-Software-Engineering-Anniversary/dp/0201835959">classic blunder</a>, almost as well-known as "never get involved in a land war in Asia" and "never go against a Sicilian when death is on the line."</li><li id="footnote_1_132" class="footnote">A role I still hold, more by default than any abundance of spare time, or love of web work.</li><li id="footnote_2_132" class="footnote">Perhaps I shouldn't be too surprised, since I too was "the community" before signing on as a programmer...</li><li id="footnote_3_132" class="footnote">Though Wikipedia has quite a few other problems.</li></ol>]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=132</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Being on the Red Sea Does Have Its Advantages</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=129</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=129#comments</comments>
		<pubDate>Sun, 30 Oct 2011 22:21:21 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[Breathtaking True Stories from the Continuing Adventures of Etienne Vouga, PhD Student]]></category>

		<guid isPermaLink="false">http://www.evouga.shardstorm.com/mybrainandhischain/?p=129</guid>
		<description><![CDATA[The KAUST marina offers daily snorkeling and diving trips at very reasonable prices; Friday aka "Sunday"1 six of us took advantage of this and rented a yacht for a morning at the reef. The trip from campus to the reef takes about 45 minutes, including a detour to and inspection by the nearest coast guard [...]]]></description>
				<content:encoded><![CDATA[<p>The KAUST marina offers daily snorkeling and diving trips at very reasonable prices; Friday aka "Sunday"<sup><a href="http://www.evouga.com/mybrainandhischain/?p=129#footnote_0_129" id="identifier_0_129" class="footnote-link footnote-identifier-link" title="The Saudi weekend is Thursday-Friday, with Saturday and Sunday ordinary workdays.">1</a></sup> six of us took advantage of this and rented a yacht for a morning at the reef.</p>
<p>The trip from campus to the reef takes about 45 minutes, including a detour to and inspection by the nearest coast guard station. The boat was outfitted decadently, in typical Saudi style, and made this trip extremely pleasant: an air-conditioned indoor lounge area had at least three TVs (which we didn't use), a sounds system (that played mostly acoustic covers of Beatles songs -- odd but fitting), three fully furnished bedrooms for those wanting to nap, and a kitchen area well-stocked with sandwiches, salads, drinks, fruit, brownies, profiteroles, danishes, etc for brunch. The crew was very friendly, and shared stories of their own experiences moving to KAUST, and working at the marina the past two years.</p>
<p>The Red Sea has over a thousand miles of coral reefs, the only ones in the world unaffected by bleaching due to global warming -- the algae living there are temperature-insensitive, for reasons not understood.<sup><a href="http://www.evouga.com/mybrainandhischain/?p=129#footnote_1_129" id="identifier_1_129" class="footnote-link footnote-identifier-link" title="At least as of five years ago.">2</a></sup> According to our captain many of these reefs aren't marked on GPS, for which reason, together with unpredictable currents, he avoids navigating at night. Every now and then I spotted a small island poking up out of the reef, dotted with a building and maybe a tree or two: private islands belonging to the King or princes, and strictly off-limits.</p>
<p>The water was beautiful turquoise, bath-temperature (slightly warmer, even), with almost no wind and good visibility. We were warned to watch out for strong currents, and a guide came snorkeling with us in case we had any problems, but despite being a poor swimmer I could navigate with very little effort. We saw an eel, several rays, a huge tuna, and countless other fish I couldn't begin to identify. No sharks, unfortunately. If we had brought spear-guns we could have taken the tuna home for dinner -- a popular Saudi pastime, apparently.</p>
<p>Despite glazing myself in a thick coat of SPF Infinity sunscreen I unsurprisingly still managed to burn myself to a crisp, especially my scalp -- if I'd been clever I would have remembered Barbados and grown out my hair before coming here. But oh well, so worth it.</p>
<ol class="footnotes"><li id="footnote_0_129" class="footnote">The Saudi weekend is Thursday-Friday, with Saturday and Sunday ordinary workdays.</li><li id="footnote_1_129" class="footnote">At least as of five years ago.</li></ol>]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=129</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>On Moral Proscription</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=126</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=126#comments</comments>
		<pubDate>Fri, 28 Oct 2011 22:30:53 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[The Book of Vouga]]></category>

		<guid isPermaLink="false">http://www.evouga.shardstorm.com/mybrainandhischain/?p=126</guid>
		<description><![CDATA[When we were children our parents demanded that we adhere to a bevy of family rules. Some of these we see in retrospect as common sense, enacted to protect us from credible danger: don't play in the street. Don't get in the car with strangers. Hazards our younger selves, with their incomplete understanding of the [...]]]></description>
				<content:encoded><![CDATA[<p>When we were children our parents demanded that we adhere to a bevy of family rules. Some of these we see in retrospect as common sense, enacted to protect us from credible danger: don't play in the street. Don't get in the car with strangers. Hazards our younger selves, with their incomplete understanding of the world and adult life, could not competently evaluate or even conceptualize.</p>
<p>Others we now see as well-meaning but misguided attempts at protecting us from imagined dangers; "old wives' tales" conceived in the murky past and propagated from generation to generation, despite having been debunked: don't swim for 30 minutes after you eat. Don't go out in the rain or you'll catch a cold.</p>
<p>Still others were simply expedients for maintaining order and control in the house: no dessert until you've finished your chores.</p>
<p>If challenged, perhaps our parents offered patient rational explanations for why the rules were what they are; perhaps they were even willing to engage in extended arguments over whether or not they were in fact "not fair!" But at the end of the day they held the trumps, "because I said so" and "because that's the way it is," and we obeyed because we did not have the power or will to do otherwise, and for the most part we've turned out better for it.</p>
<p>But now we've grown up, as has our common sense, reason, and experience. We've chosen to reevaluate and reject many of the more arbitrary and restrictive prohibitions we once adhered to blindly: we cross the street when we judge it's safe; we accept the kindness of strangers. We weigh for ourselves the costs, benefits, and consequences of the choices we make. Doing so is difficult -- it's hard work, thinking, and so much easier to just let other people do it for you; and it's so painful when you weigh wrong, and hurt yourself or others -- but doing so is essential if we hope to engage the wider world and leave our mark upon it.</p>
<p>Thousands of years ago we were told, allegedly, not to murder or steal from each other, to never mix meat and cheese, and to stone our gays. Perhaps it's time the human race grew up?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=126</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Smells like... burning</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=114</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=114#comments</comments>
		<pubDate>Sat, 22 Oct 2011 21:48:14 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[Breathtaking True Stories from the Continuing Adventures of Etienne Vouga, PhD Student]]></category>

		<guid isPermaLink="false">http://www.evouga.shardstorm.com/mybrainandhischain/?p=114</guid>
		<description><![CDATA["Life is but a beach chair" It's almost November and at KAUST it stills feels like summer. How much like summer? 1) I can tell how bad the heat will be by how long it takes my glasses to defog after leaving a building. Less than five second means a nice balmy day, maybe even [...]]]></description>
				<content:encoded><![CDATA[<p style="text-align: right;">"<em>Life is but a beach chair</em>"</p>
<p style="text-align: left;">It's almost November and at KAUST it stills feels like summer. How much like summer?</p>
<p style="text-align: left;">1) I can tell how bad the heat will be by how long it takes my glasses to defog after leaving a building. Less than five second means a nice balmy day, maybe even pleasant enough that a jog along the beach at sunset isn't out of the question. More than fifteen seconds and it was probably a mistake leaving the building in the first place.</p>
<p style="text-align: left;">2) The walk from my house to work takes about 15 minutes,<sup><a href="http://www.evouga.com/mybrainandhischain/?p=114#footnote_0_114" id="identifier_0_114" class="footnote-link footnote-identifier-link" title="There&#039;s also a bus that stops near my house every 15 minutes, but come on, I&#039;m little inclined to propagate the &quot;lazy American&quot; stereotype.">1</a></sup> in the early morning and late afternoon when the heat is still bearable. Both ways the sun is to my left, resulting in an asymmetric sunburn on my neck and ear from the walk to work alone.</p>
<p style="text-align: left;">KAUST has a cinema that shows a selection of two movies each week: one worth the ridiculously cheap $3 admission, and the other a Bollywood film, or chick flick, or just plain terrible. This week the former was Rise of Planet of the Apes -- a surprisingly good movie, in fact, despite being a (terribly named) sequel and having a simplistic and predictable framing plot. (Scientist at Evil Corp develops a cure for Alzheimer's; when this cure turns out to increase the intelligence of healthy patients, Evil Corp sees only the profits and ignores safety to hurry the project along; Apocalyptic Consequences ensue, etc etc.) The expressiveness of the ape faces is particularly impressive, and the CG used to accomplish this enhancement is almost seamless.</p>
<p style="text-align: left;">What I'll remember most about the experience, however, is that about three quarters of the way through the movie the picture suddenly stopped. The same frame stayed projected on the screen for over a minute, than slowly became browner, then completely black in the center, then white. It took me a while to realize that the film must have melted, then burned way, inside the projector! At least that's what I assume must have happened -- there were no announcements or anything. I left the theater to look for someone in charge, or a way into the projector room, to no avail; after an awkwardly long wait during which I seriously considered just leaving and watching the ending on Youtube, the film started up again about 10 minutes into the next scene.</p>
<ol class="footnotes"><li id="footnote_0_114" class="footnote">There's also a bus that stops near my house every 15 minutes, but come on, I'm little inclined to propagate the "lazy American" stereotype.</li></ol>]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=114</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Plucking coefficients from power series</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=95</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=95#comments</comments>
		<pubDate>Fri, 14 Oct 2011 21:53:05 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[Random Math]]></category>

		<guid isPermaLink="false">http://www.evouga.shardstorm.com/mybrainandhischain/?p=95</guid>
		<description><![CDATA[Suppose you have a power series and want a formula for the sum of coefficients . That's easy: just evaluate at 1. What if you want the sum of only the even coefficients? Again, it's obvious how to do this: What may not be obvious is that similar formulas exist for plucking out the sum [...]]]></description>
				<content:encoded><![CDATA[<p>Suppose you have a power series</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_f25c55865ca681b99b2e33c1e344cd81.gif' style='vertical-align: middle; border: none;' class='tex' alt="f(x) = a_0 + a_1 x + a_2 x^2 + \ldots + a_i x^i + \ldots" /></span><script type='math/tex;  mode=display'>f(x) = a_0 + a_1 x + a_2 x^2 + \ldots + a_i x^i + \ldots</script></p></p>
<p>and want a formula for the sum of coefficients <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_0dd3ff6e47aaaab5b1b56eb5a4184809.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\sum_k a_k" /></span><script type='math/tex'>\sum_k a_k</script>. That's easy: just evaluate <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8fa14cdd754f91cc6554c9e71929cce7.gif' style='vertical-align: middle; border: none; ' class='tex' alt="f" /></span><script type='math/tex'>f</script> at 1.</p>
<p>What if you want the sum of only the even coefficients? Again, it's obvious how to do this:</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_b94720cb3621327c2fd0bec577f51b10.gif' style='vertical-align: middle; border: none;' class='tex' alt="\frac{f(1) + f(-1)}{2} = a_0 + a_1 \frac{1-1}{2} + a_2 \frac{1+1}{2} + \ldots = a_0 + a_2 + a_4 + \ldots." /></span><script type='math/tex;  mode=display'>\frac{f(1) + f(-1)}{2} = a_0 + a_1 \frac{1-1}{2} + a_2 \frac{1+1}{2} + \ldots = a_0 + a_2 + a_4 + \ldots.</script></p></p>
<p>What may not be obvious is that similar formulas exist for plucking out the sum of every <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>-th coefficient (starting with <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_6a9275b7f966e45ffb33492e358c8dff.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="a_0" /></span><script type='math/tex'>a_0</script>) for any <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>. The formula is simply</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_116721700c0dc8d4e1b8c8ca79fe15ad.gif' style='vertical-align: middle; border: none;' class='tex' alt="\frac{\sum_{j=1}^n f(\xi_{j,n})}{n} = \sum_k a_{kn}," /></span><script type='math/tex;  mode=display'>\frac{\sum_{j=1}^n f(\xi_{j,n})}{n} = \sum_k a_{kn},</script></p></p>
<p>where <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_194b9e259166a9d763d7e6895465d170.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi_{j,n}" /></span><script type='math/tex'>\xi_{j,n}</script> are the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script><em>-th roots of unity</em>, or complex roots of the polynomial <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_0a3a3f9283f44c05219a88edb67447c0.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="x^n-1" /></span><script type='math/tex'>x^n-1</script>. The name comes from the fact that raising an <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>-th root of unity to the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>-th power gives 1 (the unit). An explicit formula for the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_363b122c528f54df4a0446b6bab05515.gif' style='vertical-align: middle; border: none; ' class='tex' alt="j" /></span><script type='math/tex'>j</script>-th <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>-th root of unity is given by deMoivre's Theorem: <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_d817c49779da067eb5e2665341627110.gif' style='vertical-align: middle; border: none; ' class='tex' alt="e^{2\pi i j/n}" /></span><script type='math/tex'>e^{2\pi i j/n}</script>. When <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_6d24e2bc97c5e4283dd8e34674afe7ea.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="n=1" /></span><script type='math/tex'>n=1</script>, 1 is the only first root of unity and we get the first formula for the sum of all coefficients. The second roots of unity are 1 and -1, and we get the second formula for every second coefficient. The fourth roots of unity are also well-known: <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_96eb90b0558c00cb884ff75f63f53546.gif' style='vertical-align: middle; border: none; ' class='tex' alt="1, -1, i" /></span><script type='math/tex'>1, -1, i</script> and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_20f011826070657b0f0092278d65ec74.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="-i" /></span><script type='math/tex'>-i</script> (it is easy to see that raising any of these to the fourth power gives 1). Thus</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_84fa69a649501fdddd0c6a1a770b0ba5.gif' style='vertical-align: middle; border: none;' class='tex' alt="\frac{f(1) + f(-1) + f(i) + f(-i)}{4} = a_0 + a_4 + a_8 + \ldots," /></span><script type='math/tex;  mode=display'>\frac{f(1) + f(-1) + f(i) + f(-i)}{4} = a_0 + a_4 + a_8 + \ldots,</script></p></p>
<p>and so on for any <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>.</p>
<p>Why does the formula work? If we expand the right-hand side we get that</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_df988bf0ad660858f2562e0c1a741b8d.gif' style='vertical-align: middle; border: none;' class='tex' alt="\frac{\sum_{j=1}^n f(\xi_{j,n})}{n} = \sum_k \frac{a_k}{n} \sum_{j=1}^n \xi_{j,n}^k." /></span><script type='math/tex;  mode=display'>\frac{\sum_{j=1}^n f(\xi_{j,n})}{n} = \sum_k \frac{a_k}{n} \sum_{j=1}^n \xi_{j,n}^k.</script></p></p>
<p>When <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8ce4b16b22b58894aa86c421e8759df3.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="k" /></span><script type='math/tex'>k</script> is a multiple of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>, the term in the right sum simplifies to <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_6c63df29780290d3c3aab151b6009589.gif' style='vertical-align: middle; border: none; ' class='tex' alt="a_k" /></span><script type='math/tex'>a_k</script>, because if <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_eed20c8c020213675189cdbdd545d7a6.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="k = cn" /></span><script type='math/tex'>k = cn</script> then <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_71f2b7b72d7809eda3975c523db63c2c.gif' style='vertical-align: middle; border: none; ' class='tex' alt="\xi_{j,n}^k = (\xi_{j,n}^n)^c = 1^c = 1" /></span><script type='math/tex'>\xi_{j,n}^k = (\xi_{j,n}^n)^c = 1^c = 1</script>.</p>
<p>It turns out that whenever <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8ce4b16b22b58894aa86c421e8759df3.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="k" /></span><script type='math/tex'>k</script> is <em>not</em> a multiple of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>, the sum of the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8ce4b16b22b58894aa86c421e8759df3.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="k" /></span><script type='math/tex'>k</script>-th powers of the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>-th roots of unity is 0:</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8b5eb8145781a52179fc98c4d5de4a56.gif' style='vertical-align: middle; border: none;' class='tex' alt="\sum_{j=1}^n \xi_{j,n}^k = 0," /></span><script type='math/tex;  mode=display'>\sum_{j=1}^n \xi_{j,n}^k = 0,</script></p></p>
<p>which explains why all of the other terms in the right sum above are zero. When <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_ceef78b61bf01306cc7e80344c92c19d.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="k=1" /></span><script type='math/tex'>k=1</script> (and <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_582f6544a82bf9c991e0826f21551430.gif' style='vertical-align: middle; border: none; ' class='tex' alt="n\neq 1" /></span><script type='math/tex'>n\neq 1</script>) the roots of unity form a regular <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>-gon in the complex plane, so it is intuitive why the sum of the first powers of the roots of unity (the average of the vertices of the <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>-gon) is zero. But what about higher powers?</p>
<p>Using the deMoivre formula we have</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_f60fcbd5c28cf0edf887b6f258bb5e76.gif' style='vertical-align: middle; border: none;' class='tex' alt="\sum_{j=1}^n \xi_{j,n}^k = \sum_{j=1}^n (e^{2\pi i j/n})^k = \sum_{j=1}^n (e^{2\pi i k/n})^j." /></span><script type='math/tex;  mode=display'>\sum_{j=1}^n \xi_{j,n}^k = \sum_{j=1}^n (e^{2\pi i j/n})^k = \sum_{j=1}^n (e^{2\pi i k/n})^j.</script></p></p>
<p>By switching the exponents around we've turned the sum into a geometric series; this series sums to</p>
<p><p style='text-align:center;'><span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_6986eb7ddc97320720fc4a094c7845be.gif' style='vertical-align: middle; border: none;' class='tex' alt="\sum_{j=1}^n (e^{2\pi i k/n})^j = \frac{ (e^{2\pi i k/n})^n - 1}{e^{2\pi i k/n} -1} = \frac{1-1}{e^{2\pi i k/n}-1};" /></span><script type='math/tex;  mode=display'>\sum_{j=1}^n (e^{2\pi i k/n})^j = \frac{ (e^{2\pi i k/n})^n - 1}{e^{2\pi i k/n} -1} = \frac{1-1}{e^{2\pi i k/n}-1};</script></p></p>
<p>when <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_8ce4b16b22b58894aa86c421e8759df3.gif' style='vertical-align: middle; border: none; padding-bottom:1px;' class='tex' alt="k" /></span><script type='math/tex'>k</script> is not a multiple of <span class='MathJax_Preview'><img src='http://www.evouga.com/mybrainandhischain/wp-content/plugins/latex/cache/tex_7b8b965ad4bca0e41ab51de7b31363a1.gif' style='vertical-align: middle; border: none; padding-bottom:2px;' class='tex' alt="n" /></span><script type='math/tex'>n</script>, the denominator doesn't vanish and so the sum is zero.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=95</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>It kinda feels like Houston again</title>
		<link>http://www.evouga.com/mybrainandhischain/?p=90</link>
		<comments>http://www.evouga.com/mybrainandhischain/?p=90#comments</comments>
		<pubDate>Sat, 08 Oct 2011 22:48:49 +0000</pubDate>
		<dc:creator>evouga</dc:creator>
				<category><![CDATA[Breathtaking True Stories from the Continuing Adventures of Etienne Vouga, PhD Student]]></category>

		<guid isPermaLink="false">http://www.evouga.shardstorm.com/mybrainandhischain/?p=90</guid>
		<description><![CDATA[Â "I will go in this way, and find my own way out" I went jogging at 10 PM, long after sunset, yet still I felt like I was working out in a sauna. The heat itself isn't all bad -- I'd estimate the temperature at night to be in the mid-80s -- but it's the [...]]]></description>
				<content:encoded><![CDATA[<p style="text-align: right;">Â "<em>I will go in this way, and find my own way out</em>"<em><br />
</em></p>
<p>I went jogging at 10 PM, long after sunset, yet still I felt like I was working out in a sauna. The heat itself isn't all bad -- I'd estimate the temperature at night to be in the mid-80s -- but it's the humidity that's the killer. I sweat like a pig in the best of circumstances, and here I can barely go a mile without facing twin threats of blindness and dehydration.</p>
<p>The track itself is pristine<sup><a href="http://www.evouga.com/mybrainandhischain/?p=90#footnote_0_90" id="identifier_0_90" class="footnote-link footnote-identifier-link" title="I&#039;m tempted to go running along the sea at some point, but the beach area is unlit at night and running during the day is not going to happen.">1</a></sup> and, like everything else at KAUST, criminally underused. This has been my strongest first impression: the campus has tons of facilities, from beaches to gyms (with indoor climbing walls and a <em>bowling alley</em>, in addition to the usual fitness equipment) to food courts to a golf course to a movie theater,<sup><a href="http://www.evouga.com/mybrainandhischain/?p=90#footnote_1_90" id="identifier_1_90" class="footnote-link footnote-identifier-link" title="currently showing only two movies, Green Lantern and No Strings Attached (sounds like a chick flick), so I think I&#039;ll pass.">2</a></sup> but everywhere I go I run across maybe a dozen other people. Even walking to work it seems like I see more facilities people than students. According to a pamphlet I read while waiting to get my ID card there are 800 students on campus, and presumably that number will double by the time KAUST has been open a full four years, but right now it still feels eerily empty. Walking through my neighborhood I can almost imagine myself in a movie, scavenging a Houston suburb after the zombie apocalypse.</p>
<p>My house here is a ludicrous two-story affair, with the first floor alone easily as large as my (2-person) apartment in New York. I'm barely using half of the furniture in the bedroom, leaving the bedroom annex, library, and living room completely empty. The quality of the apartment does not quite match the quantity, however: it's obvious the place was built in great haste, and if you look closely you can see little defects everywhere like sloppy paint jobs, doorstops pointing the wrong way, curtain drawstrings that don't fully work, etc. Still, given that my NYC apartment has the hot and cold knobs in the shower reversed, a bathroom that only locks from the outside, no curtains whatsoever, and an occasional rodent problem, I'm hardly going to complain.</p>
<ol class="footnotes"><li id="footnote_0_90" class="footnote">I'm tempted to go running along the sea at some point, but the beach area is unlit at night and running during the day is <em>not</em> going to happen.</li><li id="footnote_1_90" class="footnote">currently showing only two movies, Green Lantern and No Strings Attached (sounds like a chick flick), so I think I'll pass.</li></ol>]]></content:encoded>
			<wfw:commentRss>http://www.evouga.com/mybrainandhischain/?feed=rss2&#038;p=90</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
