<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for The Math Less Traveled</title>
	<atom:link href="http://mathlesstraveled.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://mathlesstraveled.com</link>
	<description>Explorations in mathematical beauty</description>
	<lastBuildDate>Fri, 18 May 2012 19:30:04 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>Comment on Carnival of Mathematics 86 by A math carnival here?? &#171; Random Walks</title>
		<link>http://mathlesstraveled.com/2012/05/08/carnival-of-mathematics-86/#comment-10169</link>
		<dc:creator><![CDATA[A math carnival here?? &#171; Random Walks]]></dc:creator>
		<pubDate>Fri, 18 May 2012 19:30:04 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1589#comment-10169</guid>
		<description><![CDATA[[...] if you haven&#8217;t done so yet, please go check out the current carnival at the Math Less [...]]]></description>
		<content:encoded><![CDATA[<p>[...] if you haven&#8217;t done so yet, please go check out the current carnival at the Math Less [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fibonacci multiples by Brent</title>
		<link>http://mathlesstraveled.com/2012/05/15/fibonacci-multiples/#comment-10140</link>
		<dc:creator><![CDATA[Brent]]></dc:creator>
		<pubDate>Wed, 16 May 2012 22:54:10 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1639#comment-10140</guid>
		<description><![CDATA[Cool proof!

I really wish there were a &quot;preview comment&quot; button too.  But wordpress.com does not support it. =(]]></description>
		<content:encoded><![CDATA[<p>Cool proof!</p>
<p>I really wish there were a &#8220;preview comment&#8221; button too.  But wordpress.com does not support it. =(</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fibonacci multiples by JRH</title>
		<link>http://mathlesstraveled.com/2012/05/15/fibonacci-multiples/#comment-10139</link>
		<dc:creator><![CDATA[JRH]]></dc:creator>
		<pubDate>Wed, 16 May 2012 22:46:09 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1639#comment-10139</guid>
		<description><![CDATA[For $latex M = \left[\begin{array}{cc} 1 &amp; 1 \\ 1 &amp; 0 \end{array}\right]$, $latex M^{n} = \left[\begin{array}{ll} F_{n+1} &amp; F_{n} \\ F_{n} &amp; F_{n-1} \end{array}\right]$. (Proof by induction left as an exercise for the reader.)

Now assume that $latex F_{km} = K_{k}F_{m}$ for $latex k \geq 1$, which can be proven for the base cases of 1 and 2 with $latex K_{1} = 1$ and $latex K_{2} = [F_{m+1}+F_{m-1}]$ by expanding $latex M^{2m} = M^{m}M^{m}$.

Then $latex M^{(k+1)m} = M^{km}M^{m}$ and so $latex F_{(k+1)m} = F_{km+1}F_{m} + F_{km}F_{m-1} = K_{k+1}F_{m}$, with $latex K_{k+1} = [F_{km+1} + K_{k}F_{m-1}]$.


I really wish there were a &quot;preview comment&quot; button so I could double check all of that LaTeX before posting.]]></description>
		<content:encoded><![CDATA[<p>For <img src='http://s0.wp.com/latex.php?latex=M+%3D+%5Cleft%5B%5Cbegin%7Barray%7D%7Bcc%7D+1+%26+1+%5C%5C+1+%26+0+%5Cend%7Barray%7D%5Cright%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='M = &#92;left[&#92;begin{array}{cc} 1 &amp; 1 &#92;&#92; 1 &amp; 0 &#92;end{array}&#92;right]' title='M = &#92;left[&#92;begin{array}{cc} 1 &amp; 1 &#92;&#92; 1 &amp; 0 &#92;end{array}&#92;right]' class='latex' />, <img src='http://s0.wp.com/latex.php?latex=M%5E%7Bn%7D+%3D+%5Cleft%5B%5Cbegin%7Barray%7D%7Bll%7D+F_%7Bn%2B1%7D+%26+F_%7Bn%7D+%5C%5C+F_%7Bn%7D+%26+F_%7Bn-1%7D+%5Cend%7Barray%7D%5Cright%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='M^{n} = &#92;left[&#92;begin{array}{ll} F_{n+1} &amp; F_{n} &#92;&#92; F_{n} &amp; F_{n-1} &#92;end{array}&#92;right]' title='M^{n} = &#92;left[&#92;begin{array}{ll} F_{n+1} &amp; F_{n} &#92;&#92; F_{n} &amp; F_{n-1} &#92;end{array}&#92;right]' class='latex' />. (Proof by induction left as an exercise for the reader.)</p>
<p>Now assume that <img src='http://s0.wp.com/latex.php?latex=F_%7Bkm%7D+%3D+K_%7Bk%7DF_%7Bm%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='F_{km} = K_{k}F_{m}' title='F_{km} = K_{k}F_{m}' class='latex' /> for <img src='http://s0.wp.com/latex.php?latex=k+%5Cgeq+1&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='k &#92;geq 1' title='k &#92;geq 1' class='latex' />, which can be proven for the base cases of 1 and 2 with <img src='http://s0.wp.com/latex.php?latex=K_%7B1%7D+%3D+1&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='K_{1} = 1' title='K_{1} = 1' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=K_%7B2%7D+%3D+%5BF_%7Bm%2B1%7D%2BF_%7Bm-1%7D%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='K_{2} = [F_{m+1}+F_{m-1}]' title='K_{2} = [F_{m+1}+F_{m-1}]' class='latex' /> by expanding <img src='http://s0.wp.com/latex.php?latex=M%5E%7B2m%7D+%3D+M%5E%7Bm%7DM%5E%7Bm%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='M^{2m} = M^{m}M^{m}' title='M^{2m} = M^{m}M^{m}' class='latex' />.</p>
<p>Then <img src='http://s0.wp.com/latex.php?latex=M%5E%7B%28k%2B1%29m%7D+%3D+M%5E%7Bkm%7DM%5E%7Bm%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='M^{(k+1)m} = M^{km}M^{m}' title='M^{(k+1)m} = M^{km}M^{m}' class='latex' /> and so <img src='http://s0.wp.com/latex.php?latex=F_%7B%28k%2B1%29m%7D+%3D+F_%7Bkm%2B1%7DF_%7Bm%7D+%2B+F_%7Bkm%7DF_%7Bm-1%7D+%3D+K_%7Bk%2B1%7DF_%7Bm%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='F_{(k+1)m} = F_{km+1}F_{m} + F_{km}F_{m-1} = K_{k+1}F_{m}' title='F_{(k+1)m} = F_{km+1}F_{m} + F_{km}F_{m-1} = K_{k+1}F_{m}' class='latex' />, with <img src='http://s0.wp.com/latex.php?latex=K_%7Bk%2B1%7D+%3D+%5BF_%7Bkm%2B1%7D+%2B+K_%7Bk%7DF_%7Bm-1%7D%5D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='K_{k+1} = [F_{km+1} + K_{k}F_{m-1}]' title='K_{k+1} = [F_{km+1} + K_{k}F_{m-1}]' class='latex' />.</p>
<p>I really wish there were a &#8220;preview comment&#8221; button so I could double check all of that LaTeX before posting.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fibonacci multiples by Brent</title>
		<link>http://mathlesstraveled.com/2012/05/15/fibonacci-multiples/#comment-10133</link>
		<dc:creator><![CDATA[Brent]]></dc:creator>
		<pubDate>Wed, 16 May 2012 13:56:22 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1639#comment-10133</guid>
		<description><![CDATA[Yes, I can see how that would work.  It&#039;s different from both of my proofs (one of which can also be formulated in terms of those pictures, now that I have thought about it more carefully). 

Now, how about that proof using the closed form of fibonacci and symmetric polynomials? ;-)]]></description>
		<content:encoded><![CDATA[<p>Yes, I can see how that would work.  It&#8217;s different from both of my proofs (one of which can also be formulated in terms of those pictures, now that I have thought about it more carefully). </p>
<p>Now, how about that proof using the closed form of fibonacci and symmetric polynomials? <img src='http://s1.wp.com/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fibonacci multiples by Matt Gardner Spencer</title>
		<link>http://mathlesstraveled.com/2012/05/15/fibonacci-multiples/#comment-10132</link>
		<dc:creator><![CDATA[Matt Gardner Spencer]]></dc:creator>
		<pubDate>Wed, 16 May 2012 13:48:17 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1639#comment-10132</guid>
		<description><![CDATA[The key to my proof is using pictures like those here: http://mathlesstraveled.com/2011/05/24/post-without-words-1/ (especially those posted by Xander in the comments) to prove
$latex F_{mn}=F_n\cdot F_{(m-1)n+1}+F_{n-1}\cdot F_{(m-1)n}$ and then using induction.]]></description>
		<content:encoded><![CDATA[<p>The key to my proof is using pictures like those here: <a href="http://mathlesstraveled.com/2011/05/24/post-without-words-1/" rel="nofollow">http://mathlesstraveled.com/2011/05/24/post-without-words-1/</a> (especially those posted by Xander in the comments) to prove<br />
<img src='http://s0.wp.com/latex.php?latex=F_%7Bmn%7D%3DF_n%5Ccdot+F_%7B%28m-1%29n%2B1%7D%2BF_%7Bn-1%7D%5Ccdot+F_%7B%28m-1%29n%7D&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='F_{mn}=F_n&#92;cdot F_{(m-1)n+1}+F_{n-1}&#92;cdot F_{(m-1)n}' title='F_{mn}=F_n&#92;cdot F_{(m-1)n+1}+F_{n-1}&#92;cdot F_{(m-1)n}' class='latex' /> and then using induction.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fibonacci multiples by Joseph Nebus</title>
		<link>http://mathlesstraveled.com/2012/05/15/fibonacci-multiples/#comment-10128</link>
		<dc:creator><![CDATA[Joseph Nebus]]></dc:creator>
		<pubDate>Wed, 16 May 2012 01:48:54 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1639#comment-10128</guid>
		<description><![CDATA[Reblogged this on &lt;a href=&quot;http://nebusresearch.wordpress.com/2012/05/16/876/&quot; rel=&quot;nofollow&quot;&gt;nebusresearch&lt;/a&gt; and commented: 
I have not, as far as I remember, encountered this theorem before.  And for the time I&#039;ve had to think about it I realize I&#039;ve got no idea how to prove it.  However, it&#039;s a neat little result that makes me smile to hear about, and theorems that bring smiles are certainly worth sharing.]]></description>
		<content:encoded><![CDATA[<p>Reblogged this on <a href="http://nebusresearch.wordpress.com/2012/05/16/876/" rel="nofollow">nebusresearch</a> and commented:<br />
I have not, as far as I remember, encountered this theorem before.  And for the time I&#8217;ve had to think about it I realize I&#8217;ve got no idea how to prove it.  However, it&#8217;s a neat little result that makes me smile to hear about, and theorems that bring smiles are certainly worth sharing.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fibonacci multiples by Joseph Nebus</title>
		<link>http://mathlesstraveled.com/2012/05/15/fibonacci-multiples/#comment-10127</link>
		<dc:creator><![CDATA[Joseph Nebus]]></dc:creator>
		<pubDate>Wed, 16 May 2012 01:46:25 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1639#comment-10127</guid>
		<description><![CDATA[I&#039;d never heard of this theorem before and I&#039;m captivated by it.  I&#039;d have expected to run across it in those occasional lists of cool mathematics trivia.]]></description>
		<content:encoded><![CDATA[<p>I&#8217;d never heard of this theorem before and I&#8217;m captivated by it.  I&#8217;d have expected to run across it in those occasional lists of cool mathematics trivia.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fibonacci multiples by Brent</title>
		<link>http://mathlesstraveled.com/2012/05/15/fibonacci-multiples/#comment-10125</link>
		<dc:creator><![CDATA[Brent]]></dc:creator>
		<pubDate>Tue, 15 May 2012 23:11:48 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1639#comment-10125</guid>
		<description><![CDATA[Nope, but if you know of such a proof I&#039;d love to hear it!  One of the proofs definitely uses induction, and can probably be formulated in terms of dominos, though I haven&#039;t thought about the details.  The other one is more elementary.

I would also like to see a proof involving monimos, dominos, and geronimos.]]></description>
		<content:encoded><![CDATA[<p>Nope, but if you know of such a proof I&#8217;d love to hear it!  One of the proofs definitely uses induction, and can probably be formulated in terms of dominos, though I haven&#8217;t thought about the details.  The other one is more elementary.</p>
<p>I would also like to see a proof involving monimos, dominos, and geronimos.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fibonacci multiples by Matt Gardner Spencer</title>
		<link>http://mathlesstraveled.com/2012/05/15/fibonacci-multiples/#comment-10122</link>
		<dc:creator><![CDATA[Matt Gardner Spencer]]></dc:creator>
		<pubDate>Tue, 15 May 2012 21:28:52 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1639#comment-10122</guid>
		<description><![CDATA[Sounds exciting!  I&#039;m guessing that neither of your proofs uses the closed form of fibonacci and symmetric polynomials.  But how about induction and monimos and dominos?]]></description>
		<content:encoded><![CDATA[<p>Sounds exciting!  I&#8217;m guessing that neither of your proofs uses the closed form of fibonacci and symmetric polynomials.  But how about induction and monimos and dominos?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Fibonacci multiples by Dennis</title>
		<link>http://mathlesstraveled.com/2012/05/15/fibonacci-multiples/#comment-10120</link>
		<dc:creator><![CDATA[Dennis]]></dc:creator>
		<pubDate>Tue, 15 May 2012 16:59:25 +0000</pubDate>
		<guid isPermaLink="false">http://mathlesstraveled.com/?p=1639#comment-10120</guid>
		<description><![CDATA[I wonder...]]></description>
		<content:encoded><![CDATA[<p>I wonder&#8230;</p>
]]></content:encoded>
	</item>
</channel>
</rss>

